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.
2015
2015
This paper presents a voice conversion technique using deep neural networks (DNNs) to map the spectral envelopes of a source… 
2011
2011
Reduction of power consumption is a paramount objective in the ICT area, especially in computer and communication systems. This… 
2010
2010
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
2001
2001
The index-permutation graph (IPG) model is a natural extension of the Cayley graph model, and super-IPGs form an efficient class… 
2001
2001
A Wiener system, i.e. a cascade system consisting of a linear dynamic subsystem and a nonlinear memoryless subsystem is identi… 
1997
1997
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high… 
1994
1994
We have developed a new introduction to the computer science major, consisting of two courses, called Science of Computing 1 and… 
1987
1987
  • K. TangC. Rohrs
  • 1987
  • Corpus ID: 60582533
Adaptive recursive algorithms using output error have some very attractive properties for both adaptive recursive filtering and… 
1981
1981
  • B. Friedlander
  • 1981
  • Corpus ID: 37544520
A new version of the recursive maximum likelihood algorithm for parameter estimation is presented. Using a modified pre-filter…