# 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} }

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

#### Figures and Topics from this paper

#### 394 Citations

Computability equivalence of an extended Petri net model

- Mathematics
- 2016

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

- Computer Science
- ACM Annual Conference
- 1978

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

- Computer Science
- 2014

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

- Mathematics
- 2006

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 or… Expand

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

- 2011

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 by… Expand

COMPUTABILITY POWER OF AN EXTENDED PETRI NET MODEL ( APN )

- Mathematics
- 2016

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

- Computer Science
- JACM
- 1970

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

#### References

SHOWING 1-10 OF 34 REFERENCES

A Variant to Turing's Theory of Computing Machines

- Computer Science
- JACM
- 1957

It will be proved that a theoretically simple basic machine can be imagined and specified such that all partial recursive functions can be computed by it and only four basic types of instruction are employed for the programs. Expand

Recursive Unsolvability of a Problem of Thue

- Mathematics, Computer Science
- J. Symb. Log.
- 1947

Thue's problem is the problem of determining for arbitrarily given strings A, B on al, whether, or no, A and B are equivalent, and this problem is more readily placed if it is restated in terms of a special form of the canonical systems of [3]. Expand

Finite Combinatory Processes-Formulation 1

- Computer Science
- J. Symb. Log.
- 1936

The present formulation should prove significant in the development of symbolic logic along the lines of Godel's theorem on the incompleteness of symbolic logics and Church's results concerning… Expand

A Note on the Entscheidungsproblem

- Mathematics, Computer Science
- J. Symb. Log.
- 1936

It is shown that the general case of the Entscheidungsproblem is unsolvable in any system of symbolic logic which is adequate to a certain portion of arithmetic and is ω-consistent. Expand

On Computable Numbers, with an Application to the Entscheidungsproblem

- Mathematics
- 1937

1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated… Expand

An Unsolvable Problem of Elementary Number Theory

- Mathematics
- 1936

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use… Expand

Categorizing Automata by W-Machine Programs

- Computer Science
- JACM
- 1961

Using a simple program structure introduced in a paper by Hao Wang, it is possible to classify subclasses of Taring machines by the deletion of various types of instructions. A number of algorithms… Expand

Computability and Unsolvability

- Mathematics, Computer Science
- McGraw-Hill Series in Information Processing and Computers
- 1958

Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book… Expand

Theory of formal systems

- Mathematics
- 1962

This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.

GRAPHSCHEMATA UND REKURSIVE FUNKTIONEN

- Philosophy
- 1958

Zusammenfassung
Bei der Programmierung der Rechenautomaten ist es Brauch, den Gedankengang mit Skizzen (Blockschemata, oder in der exakten Fassung von Kaluznin Graphschemata genannt) zu begleiten… Expand