On Wed, 2005-05-11 at 11:46, Hal Finney wrote:
Eric Cavalcanti writes:
Let's define a turing machine M with a set of internal states Q,
an initial state s, a binary alphabet G={0,1}. The transition
function is f: Q X G - Q X G X {L,R} , i.e., the function
determines from the internal
I think some of the discussions about COMP and simulating people
could be better understood if we can first understand a (much)
simpler problem: a harmonic oscillator.
The relevance of this is that ultimately there might be no meaning
in saying that a string in Platonia or wherever represents
Eric Cavalcanti writes:
Let's define a turing machine M with a set of internal states Q,
an initial state s, a binary alphabet G={0,1}. The transition
function is f: Q X G - Q X G X {L,R} , i.e., the function
determines from the internal state and the symbol at the pointer
which symbol to
3 matches
Mail list logo
