Ben, So, for example, if I describe a Turing machine whose halting I prove formally undecidable by the axioms of peano arithmetic (translating the Turing machine's operation into numerical terms, of course), and then I ask you, "is this Turing machine non-halting", then would you answer, "That depends on what the meaning of is, is"? Or does the context provide enough additional information to provide a more full answer?
--Abram On Wed, Oct 29, 2008 at 10:21 AM, Ben Goertzel <[EMAIL PROTECTED]> wrote: > > >> >> To rephrase. Do you think there is a truth of the matter concerning >> formally undecidable statements about numbers? >> >> --Abram > > That all depends on what the meaning of is, is ... ;-) > > ________________________________ > agi | Archives | Modify Your Subscription ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34 Powered by Listbox: http://www.listbox.com
