Re: Prize Announced for Determining the Boundaries of Turing Machine Computation

On May 28, 8:00 am, "Jesse F. Hughes" <j...@xxxxxxxxxxxxx> wrote:

your logic . . . is the only formalization of
computer science ever given, so we must turn to CBL if we want a
formal proof, right?

That is true, actually, assuming you're not talking about proving
formal wffs of Logic, or some other system that is already formal.
Indeed, how many axiomatizations (axioms, rules, some theorems and
proofs) of any branch of Computer Science can you give?

How long need one discuss the capabilities of certain systems before
someone asks the obvious question, "Ok, could I see some
examples?" (as everyone runs for the hills, screaming personal insults
and sarcasm as a defense all the way)?

C-B

Jesse F. Hughes
"How come there's still apes running around loose and there are
humans? Why did some of them decide to evolve and some did not? Did
they choose to stay as a monkey or what?" -Kans. Board of Ed member


.

Relevant Pages