Bitcoin Forum
October 17, 2018, 06:37:56 AM
 News: Make sure you are not using versions of Bitcoin Core other than 0.17.0 [Torrent], 0.16.3, 0.15.2, or 0.14.3. More info.
 Home Help Search Donate Login Register
 Pages: [1]
 Author Topic: Understanding Godel Incompleteness on Bitcoin  (Read 264 times)
saransh
Newbie

Offline

Activity: 14
Merit: 0

 August 21, 2017, 02:54:28 AM

Consider Gödel's incompleteness theorems (specifically the second one)

"For any formal effectively generated theory T including basic arithmetical truths and also certain truths about formal provability, if T includes a statement of its own consistency then T is inconsistent."

Gödel's second incompleteness theorem proves that your theory, which assumes math is valid (aka "including basic arithmetical truths") and assumes itself to also be true, is inherently inconsistent. Math has been proven to be incomplete.

"any consistent effective formal system that includes enough of the theory of the natural numbers is incomplete: there are true statements expressible in its language that are unprovable within the system" (Gödel's first incompleteness theorem). It does, however, mean that it's impossible to prove mathematicians have nothing left to prove, so maybe its good for job security for them.

What about Bitcoin Proof Of Work Algorithm and Other Consensus rules

Thanks

1539758276
Hero Member

Offline

Posts: 1539758276

Ignore
 1539758276

1539758276
 Report to moderator
1539758276
Hero Member

Offline

Posts: 1539758276

Ignore
 1539758276

1539758276
 Report to moderator
1539758276
Hero Member

Offline

Posts: 1539758276

Ignore
 1539758276

1539758276
 Report to moderator
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1539758276
Hero Member

Offline

Posts: 1539758276

Ignore
 1539758276

1539758276
 Report to moderator
Manfred Macx
Full Member

Offline

Activity: 205
Merit: 100

 August 21, 2017, 08:05:13 AM

Gödel's incompleteness theorems concern "formal axiomatic system containing basic arithmetic" to quote Wikipedia. POW is an algorithm not a formal axiomatic system so theorems do not apply.

 Pages: [1]
 « previous topic next topic »