244 search results - page 10 / 49 » Turing machines and bimachines |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
LOGCOM
2010
13 years 2 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
HRI
2010
ACM
14 years 21 days ago
2010
ACM
—Alan Turing proposed a test for the intelligence of machines in 1950 [1]. Despite great efforts, no computer has passed this test so far. Each year, chat bots compete for the Lo...
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
117
click to vote
Book
Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.