Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Computable function

Known as: Total recursive function, Noncomputable function, Incomputable function 
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion… Expand
Wikipedia

Related topics

Related topics

50 relations
AI-completeArithmetical setBrouwer–Heyting–Kolmogorov interpretationBusy beaver
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1980
Highly Cited
1980
Computability: An Introduction to Recursive Function Theory
Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to… Expand
Highly Cited
1979
Highly Cited
1979
Methods and applications of interval analysis
  • Ramon E. Moore
  • SIAM studies in applied mathematics
  • 1979
    • Corpus ID: 12565500
Finite representations Finite evaluation Finite convergence Computable sufficient conditions for existence and convergence Safe… Expand
Highly Cited
1973
Highly Cited
1973
Textural Features for Image Classification
Texture is one of the important characteristics used in identifying objects or regions of interest in an image, whether the image… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Highly Cited
1969
Highly Cited
1969
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… Expand
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've… Expand
Highly Cited
1966
Highly Cited
1966
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1963
Highly Cited
1963
Computability of Recursive Functions
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… Expand
  • figure 1
Highly Cited
1962
Highly Cited
1962
On non-computable functions
The construction of non-computable functions used in this paper is based on the principle that a finite, non-empty set of non… Expand
Highly Cited
1948
Highly Cited
1948
The mathematical theory of communication
Scientific knowledge grows at a phenomenal pace--but few books have had as lasting an impact or played as important a role in our… Expand
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Highly Cited
1937
Highly Cited
1937
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE