John Conway: Unsettleable Arithmetical Problems

The Computer Science Colloquium
Thursday, May 17, 4:15pm, room 9204/05
John Conway (Princeton)
Title: Unsettleable Arithmetical Problems

Abstract: I plan to discuss some very simple arithmetical assertions that are
almost certainly true but unsettleable in the sense that neither their
truth nor their falsehood is provable (from the standard axioms of set
theory). The discussion mentions the 3n + 1 conjecture and involves
FRACTRAN, my very simple logical programming language.

 

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.