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
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
The Hierarchical Weighted Multi-State $k$-out-of- $n$ System Model and Its Application for Infrastructure Management
A multi-state system (MSS) model is a more flexible tool for representing engineering systems than the conventional binary system… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2007
2007
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Empirical studies have shown that participating nodes in peer-to-peer (P2P) systems are not equivalent. Some nodes, known as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Super-Recursive Algorithms
  • Mark 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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
1992
1992
An improved least squares Laplacian pyramid for image compression
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
Is this relevant?
1990
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
Is this relevant?
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