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)

Related topics

Related topics

20 relations
AlgorithmArithmetical hierarchyBioSystemsChurch–Turing thesis

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Pixel Recursive Super Resolution
Super resolution is the problem of artificially enlarging a low resolution photograph to recover a plausible high resolution… 
Highly Cited
2007
Highly Cited
2007
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Highly Cited
2006
Highly Cited
2006
Joint identification of plant rational models and noise distribution functions using binary-valued observations
Highly Cited
2006
Highly Cited
2006
A Quantitative Assessment of Group Delay Methods for Identifying Glottal Closures in Voiced Speech
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
Super-Recursive Algorithms
  • 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
Super efficiency in vector optimization
We introduce a new concept of efficiency in vector optimization. This concept, super efficiency, is shown to have many desirable… 
1992
1992
An improved least squares Laplacian pyramid for image compression
  • M. Unser
  • Signal Processing
  • 1992
  • Corpus ID: 2875387
Highly Cited
1990
Highly Cited
1990
A Simple Algorithm for Computing the Smallest Enclosing Circle
  • Sven Skyum
  • Information Processing Letters
  • 1990
  • Corpus ID: 120306819
Highly Cited
1990
Highly Cited
1990
Decision-feedback equalization of time-dispersive channels with coded modulation
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
Analysis of recursive stochastic algorithms
Recursive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the… 
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)