Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by hawkice on Thursday May 03, 2018 @11:32PM
(#16992017)
I mean, there might not be a point in optimizing a mechanical search of all possible contradictions in ZFC. Surely any contradiction would be ridiculously complex, and probably doesn't exist. No human-achievable amount of optimization will distinguish between those two.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by quickthrower2 on Thursday May 03, 2018 @06:59PM
(#16990788)
That'd make for a bad-ass proof of work.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by zitterbewegung on Thursday May 03, 2018 @07:38PM
(#16990978)
How would you create an arbitrary hard version of the problem? Or scale its hardness?
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by jabgrabdthrow on Thursday May 03, 2018 @07:41PM
(#16990986)
Shh, coins !
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by quickthrower2 on Thursday May 03, 2018 @10:20PM
(#16991748)
Well 1 coin. If you are lucky. Unspendable.
Does anyone know of any speed-optimized tests of ZFC currently running? I'd expect that they're not using Turing machines. . .