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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

We discuss the computational complexity and feasibility properties of scenario based techniques for uncertain optimization…

2014

Abstract : K-dimensional (KD) trees use binary space-partitioning algorithms to organize and store data points in K-dimensional…

2009

A recursive computation of scattering amplitudes including Majorana fermions requires a consistent definition of the fermion flow…

2006

Abstract An adaptive kernel learning (AKL) networks is proposed to model the industrial analyzer and meanwhile monitor its…

2003

It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that…

1997

Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high…

1996

A method to increase the throughput of static recursive algorithms is presented. The signal-flow graph is transformed by first…

1996

Recursive implementations of the least squares algorithm start the computation with a known set of initial conditions. The…

1995

A hidden Markov regime is a Markov process that governs the time or space dependent distributions of an observed stochastic…

1989