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
2000
Highly Cited
2000
Computable Analysis
  • K. Weihrauch
  • Texts in Theoretical Computer Science. An EATCS…
  • 2000
    • Corpus ID: 1336530
Computable Analysis studies those functions on the real numbers and related sets which can be computed by machines such as… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.5
  • figure 2.1
Is this relevant?
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
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Methods and applications of interval analysis
  • R. 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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
1969
Highly Cited
1969
Sound generation by turbulence and surfaces in arbitrary motion
The Lighthill-Curle theory of aerodynamic sound is extended to include arbitrary convective motion. The Kirchhoff description of… Expand
Is this relevant?
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
Is this relevant?
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 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
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
Is this relevant?
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