242 search results - page 25 / 49 » Zigzags in Turing Machines |
AE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We aim to construct an automatic system for the discovery of collision-based universal cellular automata that simulate Turing machines in their space-time dynamics using ...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...