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

Add categories

Keywords

Reprint years

DOI

10.1007/s11787-018-0196-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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

On TAE Machines and Their Computational Power.Apostolos Syropoulos - 2019 - Logica Universalis 13 (2):165-170.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
From Symbol to ‘Symbol’, to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.Eli Dresner & Ofra Rechter - 2016 - Minds and Machines 26 (3):253-257.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Neural and super-Turing computing.Hava T. Siegelmann - 2003 - Minds and Machines 13 (1):103-114.
Empirical Encounters with Computational Irreducibility and Unpredictability.Hector Zenil, Fernando Soler-Toscano & Joost J. Joosten - 2012 - Minds and Machines 22 (3):149-165.
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
How to Make a Meaningful Comparison of Models: The Church–Turing Thesis Over the Reals.Maël Pégny - 2016 - Minds and Machines 26 (4):359-388.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Beyond Turing equivalence.Aaron Sloman - 1996 - In Peter Millican Andy Clark (ed.), Machines and Thought The Legacy of Alan Turing. Oxford University Press. pp. 1--179.

Analytics

Added to PP
2019-12-22

Downloads
11 (#1,140,433)

6 months
9 (#312,765)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references