3378 search results - page 64 / 676 » A universe of binding and computation |
TAICPART
2006
IEEE
15 years 3 months ago
2006
IEEE
ract: Problem Statement and Hypothetical Solutions Shaukat Ali Verification and Testing Group (VT) Department of Computer Science University of Sheffield
STACS
1990
Springer
15 years 1 months ago
1990
Springer
nce abstract) GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
MCU
2004
14 years 11 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...