On the inference of Turing machines from sample computations

Artificial Intelligence 3 (C):181-198 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(72)90048-3

Links

PhilArchive



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

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

Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Turing: The Great Unknown.Aurea Anguera, Juan A. Lara, David Lizcano, María-Aurora Martínez, Juan Pazos & F. David de la Peña - 2020 - Foundations of Science 25 (4):1203-1225.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
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.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Church Without Dogma: Axioms for Computability.Wilfried Sieg - unknown
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Random reals and possibly infinite computations Part I: Randomness in ∅'.Verónica Becher & Serge Grigorieff - 2005 - Journal of Symbolic Logic 70 (3):891-913.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):521-539.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,808,280)

6 months
1 (#1,478,781)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Learning one subprocedure per lesson.Kurt VanLehn - 1987 - Artificial Intelligence 31 (1):1-40.
Programming by examples.Michael A. Bauer - 1979 - Artificial Intelligence 12 (1):1-21.

Add more citations

References found in this work

No references found.

Add more references