Corpus ID: 118289129

Computability: An Introduction to Recursive Function Theory

@inproceedings{Cutland1980ComputabilityAI,
  title={Computability: An Introduction to Recursive Function Theory},
  author={Nigel J. Cutland},
  year={1980}
}
Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to computability: Church's thesis 4. Numbering computable functions 5. Universal programs 6. Decidability, undecidability and partical decidability 7. Recursive and recursively enumerable sets 8. Arithmetic and Godel's incompleteness theorem 9. Reducibility and degrees 10. Effective operations on partial functions 11. The second recursion theorem 12. Complexity of… Expand
Unformly Applicative Structures, A Theory of Computability and Polyadic Functions
  • P. Bellot
  • Mathematics, Computer Science
  • FSTTCS
  • 1988
TLDR
A Computability theory developed from the theory of URS is described, which handles polyadicity as a primitive notion and allows a natural representation of functions with variable arity, that is functions which can be applied to sequences of arguments of any length. Expand
Probabilistic Recursion Theory and Implicit Computational Complexity
TLDR
It is shown that probabilistic computable functions can be characterized by a natural generalization of Church and Kleene's partial recursive functions, and the obtained algebra can be restricted so as to capture the notion of polytime sampleable distributions, a key concept in average-case complexity and cryptography. Expand
The Euclid Abstract Machine
TLDR
An abstract machine is built based on the historic concept of compass and ruler constructions which reveals the existence of non-computable functions not related with the halting problem. Expand
Probabilistic Recursion Theory and Implicit Computational Complexity
TLDR
Probabilistic computable functions can be characterized by a natural generalization of Church and Kleene’s partial recursive functions, and the obtained algebra can be restricted so as to capture the notion of a polytime sampleable distribution, a key concept in average-case complexity and cryptography. Expand
Intensional Kleene and Rice Theorems for Abstract Program Semantics
TLDR
It turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable over-approximation necessarily includes an infinite set of false positives which covers all the values of the semantic abstract domain. Expand
A Rice's Theorem for Abstract Semantics
TLDR
It turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable overapproximation necessarily includes an infinite set of false positives which covers all values of the semantic abstract domain. Expand
Towards Turing computability via coinduction
TLDR
This work adopts corecursion and coinduction to formalize Turing Machines and their operational semantics in the Coq proof assistant and proves the undecidability of the halting problem. Expand
Computability in HOL: A Model for Computation in Formal Logic
This paper describes the implementation of a formal model for computability theory in the logical system HOL. The computability is modeled through an imperative language formally de ned with the useExpand
Formalizing Abstract Computability: Turing Categories in Coq
TLDR
This work begins by formalizing definitions, propositions, and proofs pertaining to Turing categories, and then instantiate the more general Turing category formalism with a CIC description of the category which explicitly models the language of partial recursive functions. Expand
ORDINALS , COMPUTATIONS , AND MODELS OF SET THEORY
Ordinary computations can be characterised by register machines working with natural numbers. We study ordinal register machines where the registers can hold arbitrary ordinal numbers. The class ofExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Course in mathematical logic
  • Y. Manin
  • Mathematics, Computer Science
  • Graduate texts in mathematics
  • 1977
Provability - introduction to formal languages truth and deducibility the continuum problem and forcing the continuum problem and constructible sets computability - recursive functions and Church'sExpand
Theory of Recursive Functions and Effective Computability
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular. A second group of topics has to do with generalizationsExpand
Computability of Recursive Functions
TLDR
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 theory have been established. Expand
CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS
0. Introduction. In this paper we study a sequence of classes of computable functions for which a prediction of the complexity of the calculation may be made in a comparatively simple fashion. TheExpand
α-Recursion Theory
Publisher Summary This chapter presents the current state of α-recursion theory (i.e., recursion theory on admissible ordinals). To generalize recursion theory, one must first decide what are theExpand
Easy constructions in complexity theory: Gap and speed-up theorems
Perhaps the two most basic phenomena discovered by the recent application of recursion theoretic methods to the developing theories of computational complexity have been Blum's speed-up phenomena,Expand
Degrees of Unsolvability: A Survey of Results
Publisher Summary The structure of the degrees is essentially a classification of all sets of integers according to complexity. The recursive sets of integers comprise the lowest level of complexity.Expand
A Machine-Independent Theory of the Complexity of Recursive Functions
TLDR
The number of steps required to compute a function depends on the type of computer that is used, on the choice of computer program, and on the input-output code, but the results obtained in this paper are nearly independent of these considerations. Expand
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
In a paper entitled "On computable numbers, with an application to the Entscheidungsproblem"* the author gave a proof of the insolubility of the Entscheidungsproblem of the "engere Funktionenkalkul".Expand
An Overview of the Theory of Computational Complexity
TLDR
It is the conviction that by now this theory is an essential part of the theory of computation, and that in the future it will be an important theory which will permeate much of the theoretical work in computer science. Expand
...
1
2
3
4
...