Re:The complete story of Gödel (in)completeness
by yodsanklai on Tuesday March 12, 2024 @08:25PM
(#39686573)
How relevant are these considerations for practical use cases?
Specifically, for all practical purpose, it is sufficient to have probabilistic guarantees. Suppose an AI is able to generate mathematical proofs as well as humans, it wouldn't really matter if in theory "they are limited to solving problems in TC^0 with failure as negation"
Re:The complete story of Gödel (in)completeness
by nyrikki on Wednesday March 13, 2024 @11:27AM
(#39692485)
While TC^0 can divide or multiply through say FFT, it actually can't do counters or addition which I am pretty sure requires TC^1 or Log-depth Threshold Circuits.
Specifically, for all practical purpose, it is sufficient to have probabilistic guarantees. Suppose an AI is able to generate mathematical proofs as well as humans, it wouldn't really matter if in theory "they are limited to solving problems in TC^0 with failure as negation"