Wikipedia:Articles for deletion/Super-recursive algorithm
The article is too unfocused to judge what it is about.  It begins with a long list of examples of "algorithms that are more powerful than Turing machines."  That topic is already covered by the article on hypercomputation.  The rest of the article focuses on a single class of such examples, namely inductive Turing machines, which the article distinguishes from an ordinary Turing machine as not having to stop after producing its result.  While this vague notion could mean various things, judging by the article's reference to Gold it most likely refers to the concept treated in Language identification in the limit discovered by Gold in 1967 and rediscovered by Burgin in the 1980s.  Burgin does not make clear whether he wants "super-recursive algorithm" to be the new name for hypercomputation, language identification in the limit, or something in between.  In any event no one but Burgin and the two anonymous Wikipedia editors of the article have found any use for the term, making  the applicable guideline.  The controversy is not notable outside Wikipedia (there is nothing controversial about Martin Davis's negative review) whence my recommendation to delete
— User:Vaughan, 03:08, 27 May 2008 (UTC)
Stance: delete
Cited policy: WP:FRINGE (Wikipedia:Fringe theories)