Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,212,297 papers from all fields of science
Search
Sign In
Create Free Account
Computable function
Known as:
Total recursive function
, Noncomputable function
, Incomputable function
Expand
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AI-complete
Arithmetical set
Brouwer–Heyting–Kolmogorov interpretation
Busy beaver
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2021
Highly Cited
2021
On computable numbers, with an application to the Entscheidungsproblem
A. Turing
Proc. London Math. Soc.
2021
Corpus ID: 73712
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable…
Expand
Highly Cited
1980
Highly Cited
1980
Computability: An Introduction to Recursive Function Theory
N. Cutland
1980
Corpus ID: 118289129
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
R. Haralick
,
K. Shanmugam
,
I. Dinstein
IEEE Transactions on Systems, Man and Cybernetics
1973
Corpus ID: 206786900
Texture is one of the important characteristics used in identifying objects or regions of interest in an image, whether the image…
Expand
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
D. C. Cooper
1969
Corpus ID: 58977875
If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've…
Expand
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
Jr. Hartley Rogers
1969
Corpus ID: 122951574
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
Sound generation by turbulence and surfaces in arbitrary motion
J. E. Ffowcs Williams
,
D. L. Hawkings
Philosophical transactions of the Royal Society…
1969
Corpus ID: 19155680
The Lighthill-Curle theory of aerodynamic sound is extended to include arbitrary convective motion. The Kirchhoff description of…
Expand
Highly Cited
1963
Highly Cited
1963
Computability of Recursive Functions
J. Shepherdson
,
Howard E. Sturgis
JACM
1963
Corpus ID: 17328540
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
Highly Cited
1962
Highly Cited
1962
On non-computable functions
T. Rado
1962
Corpus ID: 121334247
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
1950
Highly Cited
1950
The mathematical theory of communication
C. Shannon
1950
Corpus ID: 125327631
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE