Skip to search formSkip to main contentSkip to account menu

Super-recursive algorithm

Known as: Inductive Turing machine, Super recursive algorithm, Superrecursive algorithm 
In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
It is well known that the impulse response of a wideband wireless channel is approximately sparse, in the sense that it has a… 
2008
2008
In four globular clusters (GCs) a nonnegligible fraction of stars can be interpreted only as a very helium-rich population. The… 
Highly Cited
2007
Highly Cited
2007
Highly Cited
2007
Golay sequences and complementary sets of sequences have been long studied for their application in multisensor and communication… 
Highly Cited
2006
Highly Cited
2006
The generalized multi-state k-out-of-n:G system model defined by Huang provides more flexibilities for modeling of multi-state… 
Highly Cited
2005
Highly Cited
2005
It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that… 
2001
2001
The index-permutation graph (IPG) model is a natural extension of the Cayley graph model, and super-IPGs form an efficient class… 
1999
1999
All approaches to high performance computing is naturally divided into three main directions: development of computational… 
Highly Cited
1990
Highly Cited
1990
An extension is presented of the work of V.M. Eyubogin (see ibid., vol.36, p.401-9, Apr. 1988) on decision-feedback equalization…