On TAE Machines and Their Computational Power

Logica Universalis 13 (2):165-170 (2019)
  Copy   BIBTEX

Abstract

Trail-And-Error machines have been proposed by Hintikka and Mutanen as an alternative formulation of the notion of computation. These machines extend the capabilities of the Turing machine and widen the theory of computation.

Categories

Keywords

Reprint years

DOI

10.1007/s11787-018-0196-5

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,101

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.
Computation.B. Jack Copeland - 2003 - In Luciano Floridi, The Blackwell guide to the philosophy of computing and information. Blackwell. pp. 1–17.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
The interactive nature of computing: Refuting the strong church–turing thesis. [REVIEW]Dina Goldin & Peter Wegner - 2008 - Minds and Machines 18 (1):17-38.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.

Analytics

Added to PP
2018-07-16

Downloads
51 (#465,644)

6 months
1 (#1,593,032)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.
Language, Truth and Logic in Mathematics.Jaakko Hintikka - 2001 - Studia Logica 68 (3):412-415.

Add more references