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.
2018
2018
Bobrovsky–Zakai-Type Bound for Periodic Stochastic Filtering
Mean-squared-error (MSE) lower bounds are commonly used for performance analysis and system design. Recursive algorithms have… 
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… 
2009
2009
The role of lithium production in massive AGB and super-AGB stars for the understanding of multiple populations in globular clusters
Lithium is made up in the envelopes of massive asymptotic giant branch (AGB) stars through the process of Hot Bottom Burning. In… 
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… 
2001
2001
Recursive identification of Wiener systems
A Wiener system, i.e. a cascade system consisting of a linear dynamic subsystem and a nonlinear memoryless subsystem is identi… 
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… 
1981
1981
A modified pre-filter for some recursive parameter estimation algorithms
  • B. Friedlander
  • 20th IEEE Conference on Decision and Control…
  • 1981
  • Corpus ID: 37544520
A new version of the recursive maximum likelihood algorithm for parameter estimation is presented. Using a modified pre-filter… 
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)