Talk:Super-recursive algorithm

This article was nominated for deletion on 25 May 2008. The result of the discussion was no consensus.

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

Archives

/Archive1

Copyediting 2009-3-14

I did some copyediting today, after someone wisely pointed out that the article was very difficult to read.

At present, I am pretty happy with the neutrality of the lede section. The next few sections are just OK, and the section "Schmidhuber's generalized Turing machines" is pretty rough. — Carl (CBM · talk) 00:13, 15 March 2009 (UTC)[reply]

This page is still here?

Amazing.

The page is misleading on (at least) two points. The first is the content, but it is not sufficient to be "neutral" with respect to that. Because the second is the term itself. There's room on Wikipedia for notable dissent with the Church-Turing thesis, but "Super-recursive algorithm" is still an idiosyncratic term, and most of the dissenters cited by Burgin do not use it.

I still advocate very heavily trimming this page and stuffing whatever's left into hypercomputation or other target. --Unzerlegbarkeit (talk) 05:33, 28 December 2009 (UTC)[reply]

I have started. Is there someone who can explain the difference between "inductive turing machine" and Schmidhuber's scheme? --Unzerlegbarkeit (talk) 00:43, 1 August 2010 (UTC)[reply]