9 Jan
2012
9 Jan
'12
11:48 a.m.
On Sat, Jan 7, 2012 at 12:00 PM, Dan Asimov <dasimov@earthlink.net> wrote:
In number theory (as used in Gödel's undecidability proof) what is the probability that a statement is undecidable?
Could almost all statements be undecidable?
Yes, nearly all statements are undecidable (at least, when encoded in a prefix-free form). http://www.sciencedirect.com/science/article/pii/S0196885804001277 -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com