You are viewing a single comment's thread from:
RE: How to add math to Steemit Posts
Thanks! Now I can write math formulas in my posts! Planning on writing articles about Gödels incompleteness theorem and algorithmic information theory.
Thanks! Now I can write math formulas in my posts! Planning on writing articles about Gödels incompleteness theorem and algorithmic information theory.
hey man Thanks for upvoting my friends @uncerntropy and his new post about Bitcoin and financial freedom, and yeah man Math is amazing look at how Math has changed the world with crypto currency and how simpole math algorithms have generated hundreds of billions of dollars out of the Aether but are now more real than dollars and more valuable than Gold
Wow Godel? incompleteness theorem?
https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems
"Gödel's incompleteness theorems
From Wikipedia, the free encyclopedia
Gödel's incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic.[1] These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible.
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 the natural numbers. For any such formal system, there will always be statements about the 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.
Employing a diagonal argument, Gödel's incompleteness theorems were the first of several closely related theorems on the limitations of formal systems. They were followed by Tarski's undefinability theorem on the formal undefinability of truth, Church's proof that Hilbert's Entscheidungsproblem is unsolvable, and Turing's theorem that there is no algorithm to solve the halting problem."
hey and i upvoted all your recent comments! heres the screenshot proof!
Thanks for helping my new steemit user friend @uncerntropy he will keep posting good articles like that!
hey I followed you! I need to support more Math Enthusiasts with my steempower!