Effective procedures and computable functions

Minds and Machines 5 (1):9-23 (1995)
  Copy   BIBTEX

Abstract

  Horsten and Roelants have raised a number of important questions about my analysis of effective procedures and my evaluation of the Church-Turing thesis. They suggest that, on my account, effective procedures cannot enter the mathematical world because they have a built-in component of causality, and, hence, that my arguments against the Church-Turing thesis miss the mark. Unfortunately, however, their reasoning is based upon a number of misunderstandings. Effective mundane procedures do not, on my view, provide an analysis of ourgeneral concept of an effective procedure; mundane procedures and Turing machine procedures are different kinds of procedure. Moreover, the same sequence ofparticular physical action can realize both a mundane procedure and a Turing machine procedure; it is sequences of particular physical actions, not mundane procedures, which enter the world of mathematics. I conclude by discussing whether genuinely continuous physical processes can enter the world of real numbers and compute real-valued functions. I argue that the same kind of correspondence assumptions that are made between non-numerical structures and the natural numbers, in the case of Turing machines and personal computers, can be made in the case of genuinely continuous, physical processes and the real numbers

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Is the church-Turing thesis true?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
On effective procedures.Carol E. Cleland - 2002 - Minds and Machines 12 (2):159-179.
Recipes, algorithms, and programs.Carol E. Cleland - 2001 - Minds and Machines 11 (2):219-237.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.

Analytics

Added to PP
2009-01-28

Downloads
80 (#205,770)

6 months
11 (#226,317)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Carol Cleland
University of Colorado, Boulder

Citations of this work

The Tractable Cognition Thesis.Iris Van Rooij - 2008 - Cognitive Science 32 (6):939-984.
The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Recipes, algorithms, and programs.Carol E. Cleland - 2001 - Minds and Machines 11 (2):219-237.

View all 15 citations / Add more citations

References found in this work

Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
Mental Algorithms: Are Minds Computational Systems?James H. Fetzer - 1994 - Pragmatics and Cognition 2 (1):1-29.
Mental algorithms: Are minds computational systems?James H. Fetzer - 1994 - Pragmatics and Cognition 21 (1):1-29.

View all 8 references / Add more references