429 search results - page 31 / 86 » Noisy Turing Machines |
IAT
2007
IEEE
15 years 4 months ago
2007
IEEE
I introduce a new approach to data representation, which reflects the mechanism of mind based on the compartmentalization of brain into two hemispheres. I cribe an abstract device...
AE
2007
Springer
15 years 3 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 ...
102
click to vote
ATVA
2007
Springer
15 years 3 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
15 years 3 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
15 years 3 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...