Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

20 relations
AlgorithmArithmetical hierarchyBioSystemsChurch–Turing thesis
Expand

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Joint identification of plant rational models and noise distribution functions using binary-valued observations
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Highly Cited
2006
Highly Cited
2006
Nonblocking supervisory control of state tree structures
It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that… Expand
  • figure 1
  • figure 3
  • figure 7
  • figure 5
  • figure 6
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Super-Recursive Algorithms
  • M. Burgin
  • Monographs in Computer Science
  • 2005
    • Corpus ID: 5671680
* The first exposition on super-recursive algorithms, systematizing all main classes and providingan accessible, focused… Expand
Highly Cited
2002
Highly Cited
2002
Stochastic approximation in nonparametric identification of Hammerstein systems
  • W. Greblicki
  • IEEE Trans. Autom. Control.
  • 2002
    • Corpus ID: 16278406
Derived from the idea of stochastic approximation, recursive algorithms to identify a Hammerstein system are presented. Two of… Expand
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 6
1999
1999
Super-recursive Algorithms as a Tool for High Performance Computing
All approaches to high performance computing is naturally divided into three main directions: development of computational… Expand
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… Expand
1992
1992
An improved least squares Laplacian pyramid for image compression
  • M. Unser
  • Signal Process.
  • 1992
    • Corpus ID: 2875387
Abstract This paper describes two ways of improving Burt and Adelson's Laplacian pyramid, a technique developed for image… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 10
Highly Cited
1976
Highly Cited
1976
Analysis of recursive stochastic algorithms
Recursive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE