Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-22T16:14:59.049Z Has data issue: false hasContentIssue false

CHAPTER 2 - RECURSION THEORY

from Part 1 - Basic proof theory and computability

Published online by Cambridge University Press:  05 January 2012

Helmut Schwichtenberg
Affiliation:
Ludwig-Maximilians-Universität Munchen
Stanley S. Wainer
Affiliation:
University of Leeds
Get access

Summary

In this chapter we develop the basics of recursive function theory, or as it is more generally known, computability theory. Its history goes back to the seminal works of Turing, Kleene and others in the 1930s.

A computable function is one defined by a program whose operational semantics tell an idealized computer what to do to its storage locations as it proceeds deterministically from input to output, without any prior restrictions on storage space or computation time. We shall be concerned with various program styles and the relationships between them, but the emphasis throughout this chapter and in part 2 will be on one underlying data type, namely the natural numbers, since it is there that the most basic foundational connections between proof theory and computation are to be seen in their clearest light. This is not to say that computability over more general and abstract data types is less important. Quite the contrary. For example, from a logical point of view, Stoltenberg-Hansen and Tucker [1999], Tucker and Zucker [2000], [2006] and Moschovakis [1997] give excellent presentations of a more abstract approach, and our part 3 develops a theory in higher types from a completely general standpoint.

The two best-known models of machine computation are the Turing Machine and the (Unlimited) Register Machine of Shepherdson and Sturgis [1963]. We base our development on the latter since it affords the quickest route to the results we want to establish (see also Cutland [1980]).

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×