Re: What is complexity?
- From: kim@xxxxxxxxxxx (Kim G. S. Øyhus)
- Date: Tue, 29 Nov 2005 12:36:02 +0000 (UTC)
In article <5EQif.6768$6e5.5733@trnddc09>,
R. Baldwin <res0k7yx@xxxxxxxxxxxxxxxxxxxx> wrote:
>"Kim G. S. Øyhus" <kim@xxxxxxxxxxx> wrote in message
>news:dmeukq$mts$1@xxxxxxxxxxxxxxxxxxxxx
>> You have often lately asked me to study stuff I already know.
>>
>> None of what you have said contradicts my statement that it is not
>> necessary to have an infinite tape in a physical Turing machine, as
>> long as the tape can grow.
>>
>> You still misunderstand me, even when I write it simply and directly.
>>
>
>I understand that you are wrong.
Sigh. You are quite stupid. Look here:
This is a simple representation of 3 Turing compatible machines.
One with an infinite tape:
A: H00000000000000000000000000000000000000.....................
And two with a finite tape
B: H00000000000000000000000000000000000
C: H00000000000000000000000000000000000
After a while running the same program, they have made some output,
and moved the head, H:
A: 100010111100000101111H00000000000000000.....................
B: 100010111100000101111H00000000000000
C: 100010111100000101111H00000000000000
Note, that they have made the same output, even though one are
infinite, while the others are finite.
A while later, the head reaches the end of the finite tape:
A: 10001011110000010111100010011100000H000.....................
B: 10001011110000010111100010011100000H
C: 10001011110000010111100010011100000H
The B machine then grows:
A: 10001011110000010111100010011100000H000.....................
B: 10001011110000010111100010011100000H00000000000
C: 10001011110000010111100010011100000H
And they both continue, while C has halted:
A: 10001011110000010111100010011100000111100H00.....................
B: 10001011110000010111100010011100000111100H00000
C: 10001011110000010111100010011100000H
And each time the head of the B machine reaches the end of the tape,
the tape grows bigger. And since the heads on both machines will
encounter precisely the same data, both machines will give the same
output.
This is how a finite growing machine can be a perfect Turing
machine. Since a true Turing machine always only uses a finite amount
of its infinite tape, because the head can only move 1 step at a time,
it does not matter wether the unused portion of the tape is there or
not, as long as it is there when it is needed, and the infinite ends
of the tape are never needed in a finite amount of time.
Kim0
.
- References:
- Re: What is complexity?
- From: Kim G. S. Øyhus
- Re: What is complexity?
- Prev by Date: Re: The ToE is nothing more than..
- Next by Date: Re: Limited knowledge on Evolution
- Previous by thread: Re: What is complexity?
- Next by thread: Re: What is complexity?
- Index(es):
Relevant Pages
|