The Computer Science Colloquium
Thursday, May 17, 4:15pm, room 9204/05
Unsettleable Arithmetical Problems
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 invloves FRACTRAN, my very simple logical programming language.
The Colloquium is supported by generous contributions from
the Bloomberg, Information Builders, Inc., and Netlogic,
365 Fifth Ave, New York City 10016 | Room 4319 | Phone: 212.817.8190 | Fax: 212.817.1510 | firstname.lastname@example.org