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
2009
Highly Cited
2009
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to… 
Highly Cited
2008
Highly Cited
2005
Highly Cited
2005
Primates demonstrate unparalleled ability at rapidly orienting towards important events in complex dynamic environments. During… 
Highly Cited
2001
Highly Cited
2001
Biped robots form a subclass of legged or walking robots. The study of mechanical legged motion has been motivated by its… 
Highly Cited
2000
Highly Cited
1999
Highly Cited
1990
Highly Cited
1990
This article discusses building a computable design process model, which is a prerequisite for realizing intelligent computer… 
Review
1988
Review
1988
T-he question of the wisdom of adopting an export-promoting trade strategy has recurred in the history of the developing… 
Highly Cited
1981
Highly Cited
1981
  • M. Safonov
  • 1981
  • Corpus ID: 21232884
For diagonally perturbed linear time-invariant multivariable feedback systems, the problem of finding an improved… 
Highly Cited
1980
Highly Cited
1980
This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions…