Skip to content
Back to the collection

How real are real numbers?

G. J. Chaitin

2004 · arXiv

Read the paper
HN score
1
Mentions
10
Readers
10
Months
10
What’s in a score?

From the abstract

We discuss mathematical and physical arguments against continuity and in favor of discreteness, with particular emphasis on the ideas of Emile Borel (1871-1956).

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

10 selected excerpts · 10 total mentions

akssri
Recommendation · rule
Theory of Computation wasn't around when all this "exciting" stuff was developed in Mathematics. Given their non-constructive nature "real" numbers are unsurprisingly totally incompatible with computation. Chaitin has a great paper on this and shows how Cantor's constructions were reflected a half-century later by Turing. https://arxiv.org/abs/math/0411418 Except of-course, while "hyper-Turing" machines that can do magic "post-Turing" "post-Halting" computation are seen as absurd fictions, real-numbers are seen as "normal" and "obvious" and "common-sensical"! It was amusing sometime back to see people pooh-pooh the likes of Hava Siegelmann for being funded for their…
Read the full comment
"super-Turing" machines with "real-number" computation, without realizing that the core issue is the "real"-number itself! I've always found this quite strange, but I've realized that this is almost blasphemy (people in STEM, and esp. their "allies", aren't as enlightened etc. as they pretend to be tbh). Some historicans of mathematics claim (C. K. Raju for eg.) that this comes from the insertion of Greek-Christian theological bent in the development of modern mathematics. Anyone who has taken measure theory etc. and then gone on to do "practical" numerical stuff, and then realizes the pointlessness of much of this hard/abstract construction dealing with "scary" monsters that can't even be computed, would perhaps wholeheartedly agree. edit: The post has a great link to a note on Cantor's theology, https://apeironcentre.org/theology-of-georg-cantor/
yamrzou
Neutral mention · rule
Thanks for sharing. I'm going to add here some links that I've been curating regarding the "existence" of infinity: The physics of infinity - https://www.nature.com/articles/s41567-018-0238-1.epdf?share... - Discussion: https://news.ycombinator.com/item?id=17599087 Is infinity Real? - https://www.quantamagazine.org/the-infinity-puzzle-20160616 - Solution: https://www.quantamagazine.org/the-infinity-puzzle-solution-... Do infinities exist in nature? - https://plus.maths.org/content/do-infinities-exist-nature-0 Does infinity exist? - http://plus.maths.org/content/does-infinity-exist - Discussion: https://news.ycombinator.com/item?id=4526049 How to count past infinity -…
Read the full comment
https://youtu.be/SrU9YDoXE88 How real are real numbers? - https://arxiv.org/abs/math/0411418 - Discussion: https://news.ycombinator.com/item?id=14080024 / https://news.ycombinator.com/item?id=24029791 Are Real Numbers Real? - https://ptolemy.berkeley.edu/~eal/pnerd/blog/are-real-number... - Discussion: https://news.ycombinator.com/item?id=33316803
rstuart4133
Neutral mention · rule
Yes, that Scott Aaronson paper was an eye opener for me. It wasn't because of the correspondence between Godel's theorems and the halting problem, although for a computer programmer Aaronson's formulation turns Godel's inscrutable theorem into something easily accessible. (Oh, and for the curious, the reason Godel's theorem is so hard to understand is he needed a computer programming language for his proof but there were none lying around back then, so he invented his own. I strongly suspect he wasn't thinking of it as a series of executable steps, let alone a programming language whose most important property is to be readable. As a consequence it's bloody terrible.) No,…
Read the full comment
it was because it Aaronson made it plain both the halting problem and Godel's theorem are really statements about the difficulty of reasoning about infinities. The infinities are really well hidden in both approaches, but once you uncover them it's like seeing the elephant in the room - it all becomes obvious. And it also becomes evident they aren't particularly relevant to anything you are likely to encounter here on earth. That's because there are no infinities in our corner of the universe. And, there there is no halting problem for finite, bounded systems. For some reason, no one ever tells you that. This paper, listed here on HN recently, explains it much better than I can: https://arxiv.org/abs/math/0411418
carapace
Neutral mention · rule
Greg Buchholz in the site's comments linked to Gregory Chaitin's "How real are real numbers?"[1] and asks, > Isn't it a little bit crazy to talk about computations on real numbers, when most of them are uncomputable/unnameable? [1] https://arxiv.org/pdf/math/0411418.pdf > Experimental physicists know how difficult accurate measurements are. No physical quantity has ever been measured with more than 15 or so digits of accuracy. Mathematicians, however, freely fantasize with infinite-precision real numbers. Nevertheless within pure math the notion of a real number is extremely problematic. We’ll compare and contrast two parallel historical episodes: > 1. the diagonal and probabilistic proofs that reals are uncountable, and > 2. the diagonal and probabilistic proofs that there are uncomputable reals. > Both case histories open chasms beneath the feet of mathematicians.
currymj
Neutral mention · rule
Lenore Blum has worked on some things in this direction. http://www.cs.cmu.edu/~lblum/PAPERS/TuringMeetsNewton.pdf I think most computer scientists have a natural and justified distrust of the real numbers, though, because when you get down to it they are too bizarre and impossible to actually be real. (i.e. the set of computable reals has measure 0, see Chaitin). https://arxiv.org/pdf/math/0411418.pdf
jonathanstrange
Neutral mention · rule
Ah, okay, so it boils down to the question whether real numbers are physically realizable. There is a debate about that in the philosophy of physics and mathematics. AFAIK, according to the current state of physics real numbers cannot be realized within a finite amount of space, at least Gisin [1] recently argued that way and I've seen other arguments for this view before [2,3,4,5:167-170]. I also remember some argument based on thermodynamics but cannot find the reference. [1] https://arxiv.org/pdf/1803.06824.pdf [2] https://arxiv.org/abs/math/0411418 [3] https://news.ycombinator.com/item?id=14080024 [4] https://ptolemy.berkeley.edu/~eal/pnerd/blog/are-real-number... [5] https://www.sciencedirect.com/science/article/pii/S030439750...
FeepingCreature
Neutral mention · rule
I think there's a legitimate question as to whether every real number is actually physically real. [1] It seems credible that our universe can only actually present us with a finite number of possible sensory experiences, in which case an event with probability 0 actually couldn't ever happen. That said, even if the universe can present you with an infinity of observations you can certainly only consider a finite number of classes of them, leading to the same outcome. [1] https://arxiv.org/abs/math/0411418
ttctciyf
Neutral mention · rule
The author alludes to the fact that the overwhelming majority of reals have an infinite number of decimal places that constitute an algorithmically random sequence[1] Sure, plenty of real numbers have finite (0.1, 0.01, ...) or non-random (0.111..., 0.0111..., ...) sequences of decimal places, but there are only a countable infinity of these, whereas there is an uncountable infinity of the other, "random," kind. Usually we almost exclusively deal in the only-countably-infinite subset of the reals which are not random and it's counterintuitive that these comprise a tiny tiny archipelago of order in a huge engulfing ocean of randomness, but such is the case. Gregory Chaitin's "How real are real numbers?"[2] has some relatively straightforward further reading on this if you're interested. 1: https://en.wikipedia.org/wiki/Algorithmically_random_sequenc... 2: https://arxiv.org/abs/math/0411418
jfaucett
Neutral mention · rule
This was a light and interesting read. Here is the direct link: https://arxiv.org/pdf/math/0411418.pdf "Indeed, the most important thing in understanding a complex system is to understand how it processes information. This viewpoint regards physical systems as information processors, as performing computations. This approach also sheds new light on microscopic quantum systems, as is demonstrated in the highly developed field of quantum information and quantum computation. An extreme version of this doctrine would attempt to build the world entirely out of discrete digital information, out of 0 and 1 bits." It would indeed be quite a blast to discover we are to a high degree of probability in a simulation.
GregBuchholz
Neutral mention · rule
For anyone who might be misled, here are some links that people can use to judge for themselves how "crank" someone is: Professor Norman Wildberger's homepage: http://web.maths.unsw.edu.au/~norman/ ...a paper by Wildberger tackling some of the issues in this thread: Set Theory: Should You Believe? http://web.maths.unsw.edu.au/~norman/papers/SetTheory.pdf Some interesting works by Gregory Chaitin Meta Math! The Quest for Omega https://arxiv.org/abs/math/0404335 Exploring Randomness https://www.cs.auckland.ac.nz/~chaitin/ait/ How Real are Real Numbers? https://arxiv.org/abs/math/0411418 People who are interested in ultrafinitism would also want to check out Doron Zeilberger http://www.math.rutgers.edu/~zeilberg/ and Edward Nelson https://web.math.princeton.edu/~nelson/

Keep following the thread.

More in Mathematics

More from the same topics.

1994arXiv

On proof and progress in mathematics

William P. Thurston

In response to Jaffe and Quinn [math.HO/9307227], the author discusses forms of progress in mathematics that are not captured by formal proofs of theorems, especially in his own work in the theory of foliations and geometrization of 3-manifolds and dynamical systems.

29 mentions21 months
9HN score
2012arXiv

Geometric Algebra

Eric Chisolm

This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1.

11 mentions10 months
3HN score