Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A note on outer bounds for broadcast channel
In this note we establish two facts concerning the so-called {\em New-Jersey} outer bound. We show that this outer bound is… 
2009
2009
ChemAxiom – An Ontological Framework for Chemistry in Science
We present ChemAxiom as the first ontological framework for chemistry in science. ChemAxiom enables discourse about chemical… 
Review
1999
Review
1999
Rate modulation of soft real-time tasks in autonomous robot control systems
Due to the high number of sensors managed and need to perform complex reasoning activities, real-time control systems of… 
Highly Cited
1999
Highly Cited
1999
Computable General Equilibrium Modeling for Regional Analysis
Highly Cited
1991
Highly Cited
1991
Source-Independent Call Acceptance Procedures in ATM Networks
Strategies for connection admission control in asynchronous transfer mode (ATM) networks are considered. Without any Poisson or… 
1986
1986
Optimal Approximations and Polynomially Levelable Sets
A set A not in P is polynomially levelable if any algorithm for A has speedup to a polynomial infinitely often in A: precisely… 
1985
1985
Local Rotational Symmetries
Abstract : This theis describes a new representation for two-dimensional round regions called Local Rotational Symmetries. Local… 
Highly Cited
1981
Highly Cited
1981
Completeness, Approximation and Density
Polynomial time approximations to exponential time computable problems (EXP) are considered from the point of view of structure… 
Highly Cited
1980
Highly Cited
1980
Balanced HDLC Procedures: A Performance Analysis
The prime objective of the present paper is to analyze the performance of HDLC Balanced Class of Procedures, i.e., to… 
1977
1977
A Fast Karhunen-Loeve Transform for Digital Restoration of Images Degraded by White and Colored Noise
The Karhunen-Loeve (KL) transform is known to have certain properties which make it "optimal" for many "mean-square" signal… 
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)