Computational Completeness of Interaction Machines and Turing Machines

10 pages•Published: June 22, 2012

Peter Wegner, Eugene Eberbach and Mark Burgin

Abstract

In the paper we prove in a new and simple way that Interaction
machines are more powerful than Turing machines. To do that
we extend the definition of Interaction machines to multiple interactive
components, where each component may perform simple computation.
The emerging expressiveness is due to the power of interaction and allows
to accept languages not accepted by Turing machines. The main
result that Interaction machines can accept arbitrary languages over a
given alphabet sheds a new light to the power of interaction. Despite of
that we do not claim that Interaction machines are complete. We claim
that a complete theory of computer science cannot exist and especially,
Turing machines or Interaction machines cannot be a complete model of
computation. However complete models of computation may and should
be approximated indefinitely and our contribution presents one of such
attempts.

Keyphrases: completeness, computation, expressiveness, interaction machine, turing machine

In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 405-414.

Links:	https://easychair.org/publications/paper/DXKk
	https://doi.org/10.29007/39jj

BibTeX entry

@inproceedings{Turing-100:Computational_Completeness_Interaction_Machines,
  author    = {Peter Wegner and Eugene Eberbach and Mark Burgin},
  title     = {Computational Completeness of Interaction Machines and Turing Machines},
  booktitle = {Turing-100. The Alan Turing Centenary},
  editor    = {Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {10},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/DXKk},
  doi       = {10.29007/39jj},
  pages     = {405-414},
  year      = {2012}}

Download PDF Open PDF in browser