**From:** Dirk Bruere (*dirk.bruere@gmail.com*)

**Date:** Tue Mar 07 2006 - 07:55:23 MST

**Next message:**Dirk Bruere: "Re: JOIN: Dirk Bruere"**Previous message:**Eliezer S. Yudkowsky: "Re: JOIN: Dirk Bruere"**In reply to:**H C: "Re: BOOK: Superrecursive Algorithms"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

On 3/7/06, H C <lphege@hotmail.com> wrote:

*>
*

*> > >
*

*> >
*

*> >Sounds promising! What is a superrecursive algorithm as the author
*

*> defines
*

*> >the term?
*

*> >
*

*> >- Russell
*

*>
*

*>
*

*>
*

*> The gist of the idea is effective non-terminating algorithms in general.
*

*>
*

*> Some examples he gives are called "inductive Turing machines" (of which
*

*> Turing machines, including the universal Turing machine, are special
*

*> cases),
*

*> which are said to solve the halting problem, as well as basically
*

*> annihilate
*

*> the "absolute" interpretation of the Church-Turing thesis.
*

*>
*

*> Also he describes something called limit Turing machines. His math looks
*

*> really solid (most of it is beyond me). He takes a formal and very
*

*> thorough
*

*> approach, and there are probably more references to other works than there
*

*> are sentences in the book (really).
*

*>
*

*> In a strange twist of fate, I am reading The Emperor's New Mind at the
*

*> same
*

*> time, and (although the math is beyond me, like I said), from an abstract
*

*> perspective, it appears as though Superrecursive Algorithms completely
*

*> dominates the ideas of Penrose.
*

For a succint exposition of super recursive algorithms

http://www.math.ucla.edu/~mburgin/res/compsc/res2/highperfcomp.html

Dirk

**Next message:**Dirk Bruere: "Re: JOIN: Dirk Bruere"**Previous message:**Eliezer S. Yudkowsky: "Re: JOIN: Dirk Bruere"**In reply to:**H C: "Re: BOOK: Superrecursive Algorithms"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

*
This archive was generated by hypermail 2.1.5
: Wed Jul 17 2013 - 04:00:56 MDT
*