**From:** H C (*lphege@hotmail.com*)

**Date:** Mon Mar 06 2006 - 20:29:26 MST

**Next message:**micah glasser: "Re: JOIN: Dirk Bruere"**Previous message:**Dirk Bruere: "JOIN: Dirk Bruere"**In reply to:**Russell Wallace: "Re: BOOK: Superrecursive Algorithms"**Next in thread:**Dirk Bruere: "Re: BOOK: Superrecursive Algorithms"**Reply:**Dirk Bruere: "Re: BOOK: Superrecursive Algorithms"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

*> >
*

*>
*

*>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.

**Next message:**micah glasser: "Re: JOIN: Dirk Bruere"**Previous message:**Dirk Bruere: "JOIN: Dirk Bruere"**In reply to:**Russell Wallace: "Re: BOOK: Superrecursive Algorithms"**Next in thread:**Dirk Bruere: "Re: BOOK: Superrecursive Algorithms"**Reply:**Dirk Bruere: "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
*