1999
DOI: 10.1080/00048409912348801
|View full text |Cite
|
Sign up to set email alerts
|

Beyond the universal Turing machine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2002
2002
2011
2011

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(41 citation statements)
references
References 33 publications
0
41
0
Order By: Relevance
“…Turing machines can in principle approximate machines with continuous changes, but cannot implement them exactly. This argument may also be found in [60]. A continuous machine with non-linear feedback loops may be chaotic and impossible to approximate discretely, even over short time scales.…”
Section: Continuum As a Results Of Interaction Asynchronous Communicamentioning
confidence: 87%
“…Turing machines can in principle approximate machines with continuous changes, but cannot implement them exactly. This argument may also be found in [60]. A continuous machine with non-linear feedback loops may be chaotic and impossible to approximate discretely, even over short time scales.…”
Section: Continuum As a Results Of Interaction Asynchronous Communicamentioning
confidence: 87%
“…TMs can in principle approximate machines with continuous changes, but cannot implement them exactly. This argument may also be found in (Copeland & Sylvan 1999). A continuous machine with non-linear feedback loops may be chaotic and impossible to approximate discretely, even over short time scales.…”
Section: Introductionmentioning
confidence: 87%
“…He stated that Turing machines are closed systems that do not accept input while operating, whereas the brain continually receives input from the environment. Based on this observation, Copeland has proposed the coupled Turing machine which is connected to the environment via one or more input channels 13 . However, as Christof Teuscher and Moshe Sipper have pointed out 65 , any coupled machine with a finite f In his 1951 Gibbs lecture 22 Gödel attempts to use incompleteness to reason about human intelligence.…”
Section: Modeling the Brainmentioning
confidence: 99%
“…Based on several thoughts, some authors from very diverse research areas (Philosophy, Physics, Computer Science, etc.) claim that the human mind could be more powerful than Turing Machines 47,52,13,59 . Nevertheless, they do not agree on what these "super-Turing" capabilities mean.…”
Section: Introductionmentioning
confidence: 99%