# Computability of Recursive Functions

```@article{Shepherdson1963ComputabilityOR,
title={Computability of Recursive Functions},
author={John C. Shepherdson and Howard E. Sturgis},
journal={J. ACM},
year={1963},
volume={10},
pages={217-255}
}```
• Published 1963
• Computer Science
• J. ACM
As a result of the work of Turing, Post, Kleene and Church [1, 2, 3, 9, 10, l l 12, 17, 18] it is now widely accepted ~ that the concept of "computable" as applied to a function ~ of natural numbers is correctly identified with the concept of "partial recursive." One half of this equivalence, that all functions computable by any finite, discrete, deterministic device supplied with unlimited storage are partial recursive, is relatively straightforward 3 once the elements of recursive function… Expand
394 Citations
Computability equivalence of an extended Petri net model
The notion of computability has its origin in the works of the logicians Church, Gödel, Kleene, Post and Turing. Several approaches of computation were proposed: recursive functions, Post programs,Expand
Computer Science And Recursion Theory
How recursion theory supplied computer science with specific mathematical definitions and techniques is considered, and how the computer scientist shaped this recursion-theoretic material to his own needs is considered. Expand
The Developments of the Concept of Machine Computability from 1936 to the 1960s
This chapter tries to show how Turing’s ideas were gradually adopted, developed and modified, and led, toward the end of the century, to profound reflections about the notion of a constructive object and the general notion of an algorithm. Expand
The Church-Turing Thesis
The notion of an effective method is an informal one, and attempts to characterise effectiveness, such as the above, lack rigour, for the key requirement that the method demand no insight orExpand
Modular Machines, The Word Problem for Finitely Presented Groups and Collins' Theorem
• Computer Science
• 1980
This chapter defines modular machines that are related to Minsky machines, defined in such a way that Turing computable functions are computable by modular machines, which provides a new proof that Turing-computable functions are partial recursive. Expand
FINDING THE BEST MODEL FOR CONTINUOUS COMPUTATION
While the theory of computability over countable sets is welldefined and flexible, the definition of computability over continuous sets (e.g. the real numbers), without the fortification provided byExpand
COMPUTABILITY POWER OF AN EXTENDED PETRI NET MODEL ( APN )
The notion of computability has its origin in the works of the logicians Church, Gödel, Kleene, Post and Turing. Several approaches of computation were proposed: recursive functions, Post programs,Expand
Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets
• Mathematics, Computer Science
• J. Symb. Log.
• 1984
A new, simple proof of the theorem of M. Davis, Putnam and Robinson, which states that every recursively enumerable relation A is exponential diophantine, is given, where a 1 …, a n, x 1 , …, x m range over natural numbers and R and S are functions built up from these variables and natural number constants. Expand
On the Efficiency of Algorithms
It is shown that an optimization problem of this kind is effectively solvable if and only if the set of arguments with which one is concerned is a finite one. Expand
On a complexity-based way of constructivizing the recursive functions
• Mathematics, Computer Science
• Stud Logica
• 1990
A broad ‘possibility’ proof for the existence of such classes of effectively computable functions, with Wang's idea of effective computability generalized along a number of dimensions is given. Expand