Abstract
Trail-And-Error machines have been proposed by Hintikka and Mutanen as an alternative formulation of the notion of (mechanical) computation. These machines extend the capabilities of the Turing machine and widen the theory of computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gold, E.M.: Limiting recursion. J. Symb. Log. 30, 28–48 (1965)
Hamkins, J.D., Lewis, A.: Infinite time Turing machines. J. Symb. Log. 65, 567–604 (2000)
Hintikka, J.: Language, Truth and Logic in Mathematics. Kluwer Academic Publishers, Dordrecht (1998)
Ord, T., Kieu, T.D.: The diagonal method and hypercomputation. Br. J. Philos. Sci. 56, 147–156 (2005)
Putnam, H.: Trial and error predicates and the solution to a problem of Mostowski. J. Symb. Log. 30, 49–57 (1965)
Syropoulos, A.: Hypercomputation: Computing Beyond the Church-Turing Barrier. Springer, New York (2008)
Syropoulos, A.: Hypercomputation: fantasy or reality? A position paper. Parallel Proc. Lett. 23, 1350005 (2013)
Syropoulos, A.: Demystifying Computation: A Hands-On Introduction. World Scientific, London (2017)
Weihrauch, K.: Computable Analysis: An Introduction. Springer, Berlin (2000)
Acknowledgements
I would like to thank Christos K.K. Loverdos for his help and suggestions. Also, I would like to thank the anonymous reviewer for his comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Syropoulos, A. On TAE Machines and Their Computational Power. Log. Univers. 13, 165–170 (2019). https://doi.org/10.1007/s11787-018-0196-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11787-018-0196-5