Re:Complexity No Bar to AI
by ProfHewitt on Monday February 22, 2021 @11:18PM
(#26233770)
Thanks!
The complete sentence is as follows: For example, that “theorems are provably computational enumerable” [Euclid approximately 300 BC] is a monster was only discovered after millennia when [Church 1934] used it to identify fundamental inconsistency in the foundations of mathematics that is resolved in this article."
The complete sentence is as follows: For example, that “theorems are provably computational enumerable” [Euclid approximately 300 BC] is a monster was only discovered after millennia when [Church 1934] used it to identify fundamental inconsistency in the foundations of mathematics that is resolved in this article."