# The origins of the Turing thesis myth

@inproceedings{Goldin2004TheOO, title={The origins of the Turing thesis myth}, author={Dina Q. Goldin and Peter Wegner}, year={2004} }

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…

## 6 Citations

### THE MYTH OF UNIVERSAL COMPUTATION ∗

- Computer Science
- 2005

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 of…

### Simulation Quantization: An Application of Physical Versions of the Church-Turing Thesis.

- Physics
- 2014

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 and…

### Characterization of the Dynamic Service Generation Concept

- Computer Science
- 2006

The concept of dynamic service generation is presented as a different way to provide services in computermediated contexts and promotes a substitution of an agentoriented kernel to the current object oriented kernel of services as the service oriented architecture and infrastructure for service exchanges between agents.

### Adaptation and Evolution in Dynamic Persistent Environments

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2005

### Abductive Reasoning and ICT Enhanced Learning: Towards the Epistemology of Digital Nomads

- Computer ScienceThe Information Society
- 2005

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.

### THE STROBE MODEL: DYNAMIC SERVICE GENERATION ON THE GRID

- Computer ScienceAppl. Artif. Intell.
- 2005

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.

## References

SHOWING 1-10 OF 15 REFERENCES

### Turing’s Ideas and Models of Computation

- Computer Science
- 2004

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.

### Formal languages and their relation to automata

- Computer ScienceAddison-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.

### The Turing machine paradigm in contemporary computing

- Computer Science
- 2001

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.

### Introduction to the Theory of Computation

- Computer ScienceSIGA
- 1996

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.

### On computable numbers, with an application to the Entscheidungsproblem

- Computer ScienceProc. London Math. Soc.
- 1937

This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.

### Artificial Intelligence: A Modern Approach

- Computer Science
- 1995

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.…

### The field of programmers myth

- Computer ScienceCACM
- 2004

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

- BusinessCACM
- 2003

Researchers are seeking appropriate methods to model computing and human thought to help improve the quality of knowledge in the rapidly changing environment.