Subject:
|
Re: recursion (was RE: Would-be hacker queries.) (fwd)
|
Newsgroups:
|
lugnet.robotics
|
Date:
|
Thu, 13 May 1999 17:59:06 GMT
|
Original-From:
|
Paul Speed <pspeed@augustschell.com+StopSpam+>
|
Viewed:
|
971 times
|
| |
|
|
Jim Choate wrote:
>
> ----- Forwarded message from Paul Speed -----
>
> Date: Thu, 13 May 1999 12:50:37 -0400
> From: Paul Speed <pspeed@augustschell.com>
> Subject: Re: recursion (was RE: Would-be hacker queries.) (fwd)
>
> Jim Choate wrote:
>
> > 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?
>
> ----- End of forwarded message from Paul Speed -----
>
> ?
>
> A Turing machine has a single infinite tape. It simply goes to a well known
> location on that tape and begins running the original program. There is no
> requirement the program that the Turing machine runs is on the tape, only
> its dataset. What the program does (ie r/w, jump n locations, etc.) is based
> on a if-then on whether the current location under the r/w head is 1 or 0.
Yep, my question was merely meant to provoke discussion on
if the original point could actually be used to prove or disprove
all recursion being able to be implemented as iteration. Ugh, what
a sentence. Essentially it still just boils down to iterating over
a data set... although that data set may be fairly complicated.
-Paul (pspeed@progeeks.com, http://www.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 Paul Speed ----- Date: Thu, 13 May 1999 12:50:37 -0400 From: Paul Speed <pspeed@augustschell.com> Subject: Re: recursion (was RE: Would-be hacker queries.) (fwd) (...) How would it jump back to the original tape? ----- (...) (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
|
|
|
|
