Louise Hay Logic Seminar
Sam Alexander
OSU
Well-foundedness of machine knowers
Abstract: We give an introduction to machine knowledge, and show that a truthful
machine which has basic reasoning and arithmetic abilities can
possibly know itself to be truthful, or know its own Godel number,
but not both. We then discuss well-foundedness of machine knowers:
Is there an infinite sequence of truthful machines,
each of which knows the Godel number and the truthfulness of the next? We show that this is not possible,
assuming the machines are capable of comprehending recursive ordinals.
Thursday September 15, 2011 at 3:00 PM in SEO 1227