5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal

We study two-dimensional rotation-symmetric number-conserving cellular automata working on the von Neumann neighborhood (RNCA). It is known that such automata with 4 states or less are trivial, so we investigate the possible rules with 5 states. We give a full characterization of these automata and show that they cannot be strongly Turing universal. However, we give example of constructions that allow to embed some boolean circuit elements in a 5-states RNCA

Is Turing's Thesis the Consequence of a More General Physical Principle?

We discuss historical attempts to formulate a physical hypothesis from which Turing's thesis may be derived, and also discuss some related attempts to establish the computability of mathematical models in physics. We show that these attempts are all related to a single, unified hypothesis.Comment: 10 pages, 0 figures; section 1 revised, other minor change

Efficiency Theory: a Unifying Theory for Information, Computation and Intelligence

The paper serves as the first contribution towards the development of the theory of efficiency: a unifying framework for the currently disjoint theories of information, complexity, communication and computation. Realizing the defining nature of the brute force approach in the fundamental concepts in all of the above mentioned fields, the paper suggests using efficiency or improvement over the brute force algorithm as a common unifying factor necessary for the creation of a unified theory of information manipulation. By defining such diverse terms as randomness, knowledge, intelligence and computability in terms of a common denominator we are able to bring together contributions from Shannon, Levin, Kolmogorov, Solomonoff, Chaitin, Yao and many others under a common umbrella of the efficiency theory