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
2017
Highly Cited
2017
Super resolution is the problem of artificially enlarging a low resolution photograph to recover a plausible high resolution… 
Highly Cited
2007
Highly Cited
2006
Highly Cited
2006
Measures based on the group delay of the LPC residual have been used by a number of authors to identify the time instants of… 
Highly Cited
2004
Highly Cited
2004
  • M. Burgin
  • Monographs in Computer Science
  • 2004
  • Corpus ID: 5671680
* The first exposition on super-recursive algorithms, systematizing all main classes and providingan accessible, focused… 
Highly Cited
1993
Highly Cited
1993
We introduce a new concept of efficiency in vector optimization. This concept, super efficiency, is shown to have many desirable… 
Highly Cited
1990
Highly Cited
1990
  • Sven Skyum
  • Information Processing Letters
  • 1990
  • Corpus ID: 120306819
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… 
Highly Cited
1977
Highly Cited
1977
Recursive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the…