Turing’s Ideas and Models of Computation

2004 ◽  
pp. 159-194 ◽  
Author(s):  
Eugene Eberbach ◽  
Dina Goldin ◽  
Peter Wegner
Keyword(s):  
Models Of Computation

scholarly journals Theory and applications of models of computation (TAMC 2008)

2011 ◽  
Vol 412 (18) ◽  
pp. 1645
Author(s):  
Manindra Agrawal ◽  
Angsheng Li
Keyword(s):  
Models Of Computation

New Models of Computation

2004 ◽  
Vol 47 (1) ◽  
pp. 4-9 ◽  
Author(s):  
P. Wegner
Keyword(s):  
Models Of Computation ◽  
New Models

scholarly journals Computational Completeness of Interaction Machines and Turing Machines

10.29007/39jj ◽  
2018 ◽  
Author(s):  
Peter Wegner ◽  
Eugene Eberbach ◽  
Mark Burgin
Keyword(s):  
Computer Science ◽  
Complete Theory ◽  
Simple Computation ◽  
Turing Machines ◽  
Complete Model ◽  
Models Of Computation ◽  
Computational Completeness ◽  
Definition Of

In the paper we prove in a new and simple way that Interactionmachines are more powerful than Turing machines. To do thatwe extend the definition of Interaction machines to multiple interactivecomponents, where each component may perform simple computation.The emerging expressiveness is due to the power of interaction and allowsto accept languages not accepted by Turing machines. The mainresult that Interaction machines can accept arbitrary languages over agiven alphabet sheds a new light to the power of interaction. Despite ofthat we do not claim that Interaction machines are complete. We claimthat a complete theory of computer science cannot exist and especially,Turing machines or Interaction machines cannot be a complete model ofcomputation. However complete models of computation may and shouldbe approximated indefinitely and our contribution presents one of suchattempts.

Sign in / Sign up

Export Citation Format

Share Document