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.
2014
2014
On the computational complexity and generalization properties of multi-stage and recursive scenario programs
We discuss the computational complexity and feasibility properties of scenario based techniques for uncertain optimization… 
2013
2013
Fixed point theorems in generalized metric spaces with applications to computer science
In 1994, Matthews introduced the notion of a partial metric space in order to obtain a suitable mathematical tool for program… 
2009
2009
Recursive equations for Majorana currents
A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow… 
2006
2006
AKL Networks for Industrial Analyzer Modeling and Fault Detection
Abstract An adaptive kernel learning (AKL) networks is proposed to model the industrial analyzer and meanwhile monitor its… 
2004
2004
Sorting su(cid:14)xes of two-pattern strings
, 
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… 
1996
1996
Arithmetic transformations for fast bit-serial VLSI implementations of recursive algorithms
A method to increase the throughput of static recursive algorithms is presented. The signal-flow graph is transformed by first… 
1996
1996
Equivalence between RLS algorithms and the ridge regression technique
Recursive implementations of the least squares algorithm start the computation with a known set of initial conditions. The… 
1995
1995
Recursive estimation of parameters in Markov-modulated Poisson processes
A hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic… 
1989
1989
A Universal Inductive Turing Machine
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)