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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2015
012319992015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
According to the contemporary computer science, working in the functional recursive mode, computers and computer networks… (More)
Is this relevant?
2011
2011
In this paper, we analyze network recovery algorithms, which allow computer networks to properly function in spite of failures… (More)
Is this relevant?
Review
2010
Review
2010
To build the systems that can adapt to their environments and learn from their experience is a long-standing goal and today it… (More)
  • figure 4.2
  • figure 4.3
Is this relevant?
2009
2009
This paper studies Monte Carlo methods and other stochastic algorithms from the super-recursive algorithmic perspective… (More)
Is this relevant?
2007
2007
The bacteria are great champions of evolutionary success. They can survive in the boiling water full of sulfer and salt, in the… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
 
Is this relevant?
2004
2004
Preface Three aspects of super-recursive algorithms and hypercomputation or ÿnding black swans Our engraved knowledge may bite… (More)
Is this relevant?
2004
2004
The main goal of this paper is to compare recursive algorithms such as Turing machines with such super-recursive algorithms as… (More)
Is this relevant?
2004
2004
This paper extends traditional models of machine learning beyond their one-level structure by introducing previously obtained… (More)
Is this relevant?
1999
1999
All approaches to high performance computing is naturally divided into three main directions: development of computational… (More)
Is this relevant?