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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract : K-dimensional (KD) trees use binary space-partitioning algorithms to organize and store data points in K-dimensional… 
2009
2009
A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow… 
2007
2007
Identification of the Wiener system with the nonlinear block being a piecewise-linear function is considered in the paper… 
2002
2002
  • Qian T. Zhang
  • 2002
  • Corpus ID: 26373935
Non-coherent diversity reception of M-ary FSK (MFSK) signals becomes increasingly important due to its widespread use in wireless… 
1997
1997
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high… 
1997
1997
In this article we develop a geometric formulation of operational space dynamics and control based on standard results from the… 
1996
1996
A method to increase the throughput of static recursive algorithms is presented. The signal-flow graph is transformed by first… 
1996
1996
Recursive implementations of the least squares algorithm start the computation with a known set of initial conditions. The… 
1995
1995
A hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic…