|
|
|
|
|
by mrjay42
334 days ago
|
|
You might want to check out the works of that buzzkill that Gödel is ^^ https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_... "
The first incompleteness theorem states that no consistent system of axioms whose theorems can be listed by an effective procedure (i.e. an algorithm) is capable of proving all truths about the arithmetic of natural numbers. For any such consistent formal system, there will always be statements about natural numbers that are true, but that are unprovable within the system. The second incompleteness theorem, an extension of the first, shows that the system cannot demonstrate its own consistency.
" :3 |
|
Please explain why do you believe this is relevant to the points I've made.