Bartosz Milewski on Nostr: Alfred Tarski has shown that Euclidean geometry, unlike arithmetic (see Gödel's ...
Alfred Tarski has shown that Euclidean geometry, unlike arithmetic (see Gödel's theorem), is decidable. Any statement can be proven to be either true or false.
Unfortunately the algorithm for finding such a proof has doubly exponential complexity. Math is programming.
Published at
2025-01-19 08:38:37Event JSON
{
"id": "f6d9d95d7e46c0e1b22b85cdf0975a98b4fea324694c945e5ea85760230aabf9",
"pubkey": "a60a88374d8e1cf092c7ea93662aa784fb33b3e75be7725017032e6929ebc5d5",
"created_at": 1737275917,
"kind": 1,
"tags": [
[
"proxy",
"https://mathstodon.xyz/users/BartoszMilewski/statuses/113854114498783895",
"activitypub"
]
],
"content": "Alfred Tarski has shown that Euclidean geometry, unlike arithmetic (see Gödel's theorem), is decidable. Any statement can be proven to be either true or false. \n\nUnfortunately the algorithm for finding such a proof has doubly exponential complexity. Math is programming.",
"sig": "98b40d670be9b3a91a6279ff8be2736e1f36f0232f599a7b0dd9ee104413f1ff627d2acec879931adb1184d06339e64fc3da17a9fd6ed5db0e0f2d8d7a6412e6"
}
