Advertisement

Alternative Approaches to Computability

  • A. J. Kfoury
  • Robert N. Moll
  • Michael A. Arbib
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

In the previous chapters we have developed a theory of computability based on while-programs. The legitimacy of this programming language approach has rested on the belief, embodied in Church’s Thesis, that the class of computable functions is model invariant: The while-program computable functions include the function classes that are definable by any other system, so long as that system matches our informal notion of algorithmic specification.

Keywords

Turing Machine Recursive Function Computable Function Loop Function Start Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1982

Authors and Affiliations

  • A. J. Kfoury
    • 1
  • Robert N. Moll
    • 2
  • Michael A. Arbib
    • 2
  1. 1.Department of MathematicsBoston UniversityBostonUSA
  2. 2.Department of Computer and Information ScienceUniversity of MassachusettsAmherstUSA

Personalised recommendations