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.
2008
2008
Path-constrained partial music synchronization
Digital music collections often contain different versions and interpretations of a single musical work. In view of music… 
2004
2004
Semantics of a sequential language for exact real-number computation
Highly Cited
2002
Highly Cited
2002
On the Solution of a Korteweg-De Vries Like Equation by the Decomposition Method
A new approach to a linear Korteweg-de Vries like equation is implemented by the Adomian decomposition method. The approach is… 
Highly Cited
1997
Highly Cited
1997
Financial liberalization and fiscal repression in Turkey: Policy analysis in a CGE model with financial markets
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… 
Review
1988
Review
1988
GEMPACK: General-purpose software for applied general equilibrium and other economic modellers
This paper gives a brief overview of a new suite of software designed to make it relatively painless to implement large economic… 
Review
1987
Review
1987
Robustness of nonlinear state feedback - A survey
  • S. Glad
  • at - Automatisierungstechnik
  • 1987
  • Corpus ID: 13004175
Highly Cited
1982
Highly Cited
1982
Forecasting of Hourly Load by Pattern Recognition??? a Deterministic Approach
An algorithm using pattern recognition techniques and current weather parameters to forecast hourly electric load with a lead… 
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… 
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)