Child Machines

In Jack Copeland, Jonathan Bowen, Robin Wilson & Mark Sprevak (eds.), The Turing Guide. Oxford: Oxford University Press. pp. 315-325 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

  • This entry has no external links. Add one.
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

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.
On Alan Turing's Anticipation of Connectionism.Jack Copeland & Diane Proudfoot - 1996 - Synthese 108:361-367.
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.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):521-539.
Can machines think?W. Mays - 1952 - Philosophy 27 (April):148-62.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
The church-Turing thesis and effective mundane procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Turing's o-machines, Searle, Penrose, and the brain.Jack Copeland - 1998 - Analysis 58 (2):128-138.
Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
Bringing up Turing's 'Child-Machine'.Susan G. Sterrett - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 703--713.

Analytics

Added to PP
2020-07-22

Downloads
1 (#1,884,204)

6 months
1 (#1,533,009)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Diane Proudfoot
University of Canterbury

Citations of this work

Add more citations

References found in this work

No references found.

Add more references