Twitter | Pretraživanje | |
Logic & Applications
A Computability Proof of Gödel’s First Incompleteness Theorem
10:55 - 2. pro 2019.
A Computability Proof of Gödel’s First Incompleteness Theorem
A computability proof of Gödel’s incompleteness theorem equally as strong as Gödel’s version, but much easier to deduce
Cantor’s Paradise Cantor’s Paradise @Cantor_Paradise
Reply Retweet Označi sa "sviđa mi se" More