Corpus ID: 2213259

The origins of the Turing thesis myth

  title={The origins of the Turing thesis myth},
  author={Dina Q. Goldin and P. Wegner},
In this paper, we identify and analyze the historical reasons for the widespread acceptance of what we call the Turing Thesis myth, which extends the Turing Thesis to imply that Turing Machines model all computers. This is the third in a series of related papers by the authors, beginning with [5] and continuing with [6]. 1 The Turing Thesis myth Turing's famous 1936 paper [15] developed the Turing Machine (TM) model and showed that TMs have the expressiveness of algorithms (Turing Thesis… Expand
It is shown that the concept of a Universal Computer cannot be realized. Speci cally, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable ofExpand
Simulation Quantization: An Application of Physical Versions of the Church-Turing Thesis.
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type andExpand
The paper shows how the STROBE model may not only account for the classical communicating agent approaches, but also represent a fundamental advance in modeling societies of agents in particular in dynamic service generation scenarios such as those necessary today on the Web and proposed tomorrow for the Grid. Expand
Characterization of the Dynamic Service Generation Concept
The goal of this position paper is to reflect about the concept of service in Informatics. In particular, we present in this paper the concept of dynamic service generation as a different way toExpand
Adaptation and Evolution in Dynamic Persistent Environments
It is established that indirect interaction is essential to multiagent systems (MASs) and will be useful to researchers in coordination, evolutionary computation, and design of multiagent and adaptive systems. Expand
Abductive Reasoning and ICT Enhanced Learning: Towards the Epistemology of Digital Nomads
I suggest that abduction is the mobile (or “pedestrian”) form of reasoning par excellence because it meets the demands of a mobile learner envisioned by constructivist pedagogues and there are certain features connected to advanced mobile technologies by which one may overcome some limitations of ICT-enhanced education and edutainment. Expand


Turing machines, transition systems, and interaction
A number of results are presented, including a proof that the class of PTMs is isomorphic to a general class of effective transition systems called interactive transition systems; and aProof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. Expand
Turing’s Ideas and Models of Computation
This chapter identifies three principles underlying super-Turing computation (interaction with the world, infinity of resources, and evolution of systems) and applies these principles in the discussion of the implications of super-turing computation for the future of computer science. Expand
Formal languages and their relation to automata
  • J. Hopcroft, J. Ullman
  • Computer Science
  • Addison-Wesley series in computer science and information processing
  • 1969
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory. Expand
The Turing machine paradigm in contemporary computing
The work of Hartmanis, Stearns, Karp, Cook and others showed that the refinement of the theory to resource-bounded computations gave the means to explain the many intuitions concerning the complexity or ‘hardness’ of algorithmic problems in a precise and rigorous framework. Expand
Introduction to the Theory of Computation
Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. Expand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
Intelligence Without Reason
It is claimed that the state of computer architecture has been a strong influence on models of thought in Artificial Intelligence over the last thirty years. Expand
Artificial Intelligence: A Modern Approach
The long-anticipated revision of this #1 selling book offers the most comprehensive, state of the art introduction to the theory and practice of artificial intelligence for modern applications.Expand
The field of programmers myth
The persistent public image of computing as a field of programmers has become a costly myth. Reversing it is possible but not easy.
Computation beyond turing machines
Researchers are seeking appropriate methods to model computing and human thought to help improve the quality of knowledge in the rapidly changing environment. Expand