Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^5: Worst blog post ever on teaching programming

by jdporter (Canon)
on Apr 28, 2006 at 14:01 UTC ( #546286=note: print w/ replies, xml ) Need Help??


in reply to Re^4: Worst blog post ever on teaching programming
in thread Problematic post on teaching programming

Please explain where you got the infinitely long tape...

You are mistaken. There is no requirement in the definition of Turing machine that the tape be actually infinite in size. It merely needs to be unbounded. As long as an implementation, in its execution, doesn't exceed the limits of its "tape", there's no reason it can't be a Turing machine.

We're building the house of the future together.


Comment on Re^5: Worst blog post ever on teaching programming

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://546286]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (5)
As of 2014-07-10 00:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (198 votes), past polls