Subject:
|
Re: recursion (was RE: Would-be hacker queries.) (fwd)
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Thu, 13 May 1999 16:50:37 GMT
|
Original-From:
|
Paul Speed <pspeed@augustschellNOMORESPAM.com>
|
Viewed:
|
1004 times
|
| |
|
|
Jim Choate wrote:
>
>
> This issue of a Turing machine calling a Turing machine for recursion is
> specious.
>
> A Turing machine only needs to copy a sub-set of its current dataset out to
> tape and then, using the same program, jump to it. It then does the same
> thing all over again until it reaches a termination condition.
>
> You never need more than 1 Turing machine, it can emulate multiple Turing
> machines as needed.
How would it jump back to the original tape?
-Paul (pspeed@progeeks.com)
--
Did you check the web site first?: http://www.crynwr.com/lego-robotics
|
|
Message is in Reply To:
 | | RE: recursion (was RE: Would-be hacker queries.) (fwd)
|
| ----- Forwarded message from Blake Winton ----- From: Blake Winton <Blake.Winton@pcdocs.com> Subject: RE: recursion (was RE: Would-be hacker queries.) Date: Thu, 13 May 1999 11:40:10 -0400 (From (URL) searching for "The Ackermann Function") The url (...) (25 years ago, 13-May-99, to lugnet.robotics)
|
2 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
