Sciweavers

14699 search results - page 236 / 2940
» Complexity and Cognitive Computing
Sort
View
COGSCI
2004
82views more  COGSCI 2004»
15 years 3 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
107
Voted
CAV
2009
Springer
104views Hardware» more  CAV 2009»
16 years 4 months ago
SPEED: Symbolic Complexity Bound Analysis
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
Sumit Gulwani
IFIPTCS
2010
15 years 1 months ago
Initial Segment Complexities of Randomness Notions
Schnorr famously proved that Martin-L
Rupert Hölzl, Thorsten Kräling, Frank St...
136
Voted
GC
2011
Springer
14 years 7 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...
155
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz