73 search results - page 2 / 15 » Observability of Turing Machines: A Refinement of the Theory... |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
UC
2009
Springer
13 years 12 months ago
2009
Springer
The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvab...
ENTCS
2011
13 years 9 days 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...
CIE
2005
Springer
13 years 11 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...