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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
A new approach to a linear Korteweg-de Vries like equation is implemented by the Adomian decomposition method. The approach is… 
Review
1999
Review
1999
Due to the high number of sensors managed and need to perform complex reasoning activities, real-time control systems of… 
Highly Cited
1998
Highly Cited
1998
This paper investigates asymmetric effects of monetary policy over the business cycle. A two-state Markov Switching Model is… 
Review
1988
Review
1988
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
  • S. Glad
  • 1987
  • Corpus ID: 13004175
Highly Cited
1982
Highly Cited
1982
An algorithm using pattern recognition techniques and current weather parameters to forecast hourly electric load with a lead… 
Highly Cited
1981
Highly Cited
1981
Polynomial time approximations to exponential time computable problems (EXP) are considered from the point of view of structure… 
Highly Cited
1980
Highly Cited
1980
The prime objective of the present paper is to analyze the performance of HDLC Balanced Class of Procedures, i.e., to…