はてなブックマーク

Yesno Hey and welcome to yesno. Gödel proved that any substantial logic (i.e., capable of proving awesome things) can be either consistent or complete, but it can't be both. As there's a direct correspondence between logics/proofs and programming languages/programs, we have a similar choice when designing programming languages. Any universally powerful programming language must either offer consis