|
Not Ranked
:
+0 / -0
0 score
Re: Halting Undecidability proof faulty?
Quote:
Originally Posted by Buffy
Unfortunately in this last post you've continued to demonstrate your lack of understanding of the difference between "giving a program itself as input" and "recursion." I know you have had some training in programming, but you might want to investigate the difference between these two concepts before you continue to discuss this topic.
|
Hi Buffy, Krim/TZK,
Turing Machine -- from Wolfram MathWorld
Quote:
|
A Turing machine consists of a line of cells known as a "tape" that can be moved back and forth, an active element known as the "head" that possesses a property known as "state" and that can change the property known as "color" of the active cell underneath it, and a set of instructions for how the head should modify the active cell and move the tape. At each step, the machine may modify the color of the active cell, change the state of the head, and then move the tape one unit to the left or right.
|
Out of all the basic parts: states, colors and tapes of colors the tape is the only 'moving' part of a universal Turing machine.
----------------
Corollary to the Peter Principle: Once you have promoted all of your competents to their highest level of incompetence you must change your management philosophy from top down to bottom up, because the staff at the bottom are the only competent ones in your entire organisation.
|
