Re: Transactions: good or bad?
From: Todd Bandrowsky <anakin_at_unitedsoftworks.com>
Date: 22 Jun 2003 05:38:09 -0700
Message-ID: <af3d9224.0306220438.3427488b_at_posting.google.com>
Date: 22 Jun 2003 05:38:09 -0700
Message-ID: <af3d9224.0306220438.3427488b_at_posting.google.com>
> For the purposes of the theory of computations, a chess game is a computer.
> Instead of having an infinitely long tape, it has a finite grid, and it
> evaluates a transition function with many more values than a turing machine
> evaluates. Nevertheless, the same concepts apply, and you have yet to supply
> the proof required to back your assertion that chess games are finite.
Actually, chess is a multitrack turing machine, which reduces to a single but much longer turing machine. Game theory and theorem proving are very much related. Received on Sun Jun 22 2003 - 14:38:09 CEST