Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by lmkg on Thursday May 03, 2018 @03:45PM
(#16989208)
Well, with Godel's Incompleteness Theorems, such behavior appears to be an unavoidable property of any mathematical or computational system that can do anything of note. We may or may not be able to build systems where such properties are further removed from the 'practical' aspects... although such work would necessarily build upon the work in the linked post, which is finding just how far removed it is in the current system.
[ Parent
| on HN ]
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by tialaramex on Thursday May 03, 2018 @06:37PM
(#16990663)
Not quite "anything of note" it has to be able to do arithmetic. There are very simple systems that are useful but not powerful enough for Gödel's trick and so we think those would be safe.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by davrosthedalek on Thursday May 03, 2018 @06:54PM
(#16990765)
Geometry, for example.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by yorwba on Thursday May 03, 2018 @08:53PM
(#16991357)
If your axioms of Geometry allow statements about the length of line segments, it's probably possible to implement integer arithmetic.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by roywiggins on Thursday May 03, 2018 @11:39PM
(#16992034)
Eudidean geometry is decidable.
https://math.stackexchange.com/questions/90393/why-euclidean...
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by Bromskloss on Thursday May 03, 2018 @08:07PM
(#16991113)
How does one write down those axioms?
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by roywiggins on Thursday May 03, 2018 @11:37PM
(#16992028)
Well there's Euclid's, but the famous modern one is Hilbert's. https://en.m.wikipedia.org/wiki/Hilbert%27s_axioms?wprov=sfl...