Re: Godel proved maths inconsistent not incompleteness theorem

On Mar 27, 2:32 pm, MoeBlee <jazzm...@xxxxxxxxxxx> wrote:
On Mar 26, 5:00 pm, Charlie-Boo <shymath...@xxxxxxxxx> wrote:

Wow!  What is your definition of Turing Machine in terms of ZFC set
theory?

A Turing machine is a certain kind of set of tuples. And filling in
the 'certain kind of' in the language of ZFC is not difficult.

Ok, how does it go, then?

C-B

(Isn't
it in the Boolos book you have?)

MoeBlee

.

Relevant Pages

  • Re: Godel proved maths inconsistent not incompleteness theorem
    ... A Turing machine is a certain kind of set of tuples. ... And filling in ... the 'certain kind of' in the language of ZFC is not difficult. ...
    (sci.logic)
  • Re: Godel proved maths inconsistent not incompleteness theorem
    ... the 'certain kind of' in the language of ZFC is not difficult. ... You REALLY don't know of a Turing machine as a set of tuples, ... 'Computability and Undecidability' ... ZFC, then please say exactly what is the very first step in such ...
    (sci.logic)
  • Re: Godel proved maths inconsistent not incompleteness theorem
    ... the 'certain kind of' in the language of ZFC is not difficult. ... You REALLY don't know of a Turing machine as a set of tuples, ... 'Computability and Undecidability' among other basic textbooks on ... ZFC, then please say exactly what is the very first step in such ...
    (sci.logic)
  • Re: Lets you & him fight
    ... I'm defining a new language. ... And why are you doing this in ZFC ... Because the point of the exercise is to give an interpretation of NBG ...
    (sci.logic)
  • Re: axioms of mathematical logic
    ... i base it on predicate logic and ZFC. ... manipulate expressions and objects without first setting the rules. ... first was taught the language of predicate logic, ... but then saying they can chose the axioms to use only after that. ...
    (sci.logic)