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.
2019
2019
Arithmetic complexity
We obtain lower bounds on the cost of computing various arithmetic functions and deciding various arithmetic relations from… 
2011
2011
Systematic classification of self-adapting algorithms for power-saving operation modes of ICT systems
Reduction of power consumption is a paramount objective in the ICT area, especially in computer and communication systems. This… 
2010
2010
New Approach to Recursive Identification for ARMAX Systems
For the multivariate ARMAX system <i>A</i>(<i>z</i>)<i>yk</i>=<i>B</i>(<i>z</i>)<i>uk</i>-1+<i>C</i>(<i>z</i>)<i>wk</i> recursive… 
Highly Cited
2007
Highly Cited
2007
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
2001
2001
Parallel algorithms for index-permutation graphs. An extension of Cayley graphs for multiple chip-multiprocessors (MCMP)
The index-permutation graph (IPG) model is a natural extension of the Cayley graph model, and super-IPGs form an efficient class… 
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… 
1997
1997
Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high… 
1994
1994
A three-fold introduction to computer science
We have developed a new introduction to the computer science major, consisting of two courses, called Science of Computing 1 and… 
1992
1992
An improved least squares Laplacian pyramid for image compression
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… 
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)