On 22 Apr 2009, at 20:41, Jason Resch wrote:
On Wed, Apr 22, 2009 at 1:55 AM, Kelly harmon...@gmail.com wrote:
On Apr 21, 11:31 am, Bruno Marchal marc...@ulb.ac.be wrote:
We could say that a state A access to a state B if there is a
universal machine (a universal number relation)
Stathis Papaioannou wrote:
2009/4/23 Brent Meeker meeke...@dslextreme.com:
Say a machine is in two separate parts M1 and M2, and the information
on M1 in state A is written to a punchcard, walked over to M2, loaded,
and M2 goes into state B. Then what you are suggesting is that this
2009/4/24 Brent Meeker meeke...@dslextreme.com:
Stathis Papaioannou wrote:
2009/4/23 Brent Meeker meeke...@dslextreme.com:
Say a machine is in two separate parts M1 and M2, and the information
on M1 in state A is written to a punchcard, walked over to M2, loaded,
and M2 goes into state B.
Stathis Papaioannou wrote:
2009/4/24 Brent Meeker meeke...@dslextreme.com:
Stathis Papaioannou wrote:
2009/4/23 Brent Meeker meeke...@dslextreme.com:
Say a machine is in two separate parts M1 and M2, and the information
on M1 in state A is written to a punchcard, walked
Kelly wrote:
On Apr 22, 2:02 pm, Brent Meeker meeke...@dslextreme.com wrote:
I was with you up to that last sentence. Forward or backward, we just
experience increasing entropy as increasing time, but that doesn't
warrant the conclusion that no process is required and an instant
within
5 matches
Mail list logo
