4940 search results - page 4 / 988 » On the Complexity of Universal Programs |
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
MAAMAW
1994
Springer
13 years 11 months ago
1994
Springer
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
UPP
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...