Is Some of the Platonic Mathematical World Inaccessible to Us?

  • Thread starter Thread starter wildman
  • Start date Start date
wildman
Messages
29
Reaction score
4
I am reading Hofstadter's book GEB and am in a state of being blown away. My universe has just under gone a huge expansion... I now know why people spend their lives studying this stuff. It is staggering.

On page 72, Hofstadter quotes a result: "There exist formal systems for which there is no typographical decision procedure." This follows from the result that "There exist recursively enumerable sets which are not recursive."

This made me think of Penrose's Platonic mathematical world (The Road to Reality page 20). Let's for a moment assume that this mathematical world exists and that we discover things out of it instead of just inventing math. It would seem that the results quoted in GEB means that some of this Platonic world is inaccessible to us. Correct?

Now I studied Canter last year and read a beautiful proof that demonstrated that the are an order of infinity more irrational numbers than rational numbers. The second question is: Are the formal systems for which there exist no typographical decision procedure orders of infinity "larger" (inexact word, but I'm not sure what to use) than the systems where a decision process exist? This seems to be intuitively what should be true but as Hofstadter says, you can't always trust your intuition in such things.
 
Last edited:
Mathematics news on Phys.org
Page 72 of GEB ,~^ :approve:

Keep reading. your trip has only just begun, that is a great book.
 
Last edited:
My copy of GEB is from the original printing. A few of the pages are falling out. The cover is much uglier than the modern reprint...it's mostly this ghastly tan color. But the book was a huge eye-opener, yes.

I skipped over the philosophical mumbo-jumbo at the beginning of Road to Reality and went straight to the actual math, which is much more interesting to me. I've already done enough philosophy in my life to know what I think of ontology...I don't really need to know what Penrose thinks on it.
 
If you have studied Cantor's diagonalisation argument, then I believe you will enjoy the middle section where he uses it to derive Godel's incompleteness principle.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
30
Views
8K
Replies
4
Views
2K
Replies
13
Views
3K
Replies
29
Views
10K
Replies
12
Views
5K
Replies
33
Views
4K
Replies
7
Views
3K
Back
Top