Privatdozent

Privatdozent

Share this post

Privatdozent
Privatdozent
Turing Uncomputability
Copy link
Facebook
Email
Notes
More
Essays

Turing Uncomputability

Jørgen Veisdal's avatar
Jørgen Veisdal
Aug 13, 2021
∙ Paid
14

Share this post

Privatdozent
Privatdozent
Turing Uncomputability
Copy link
Facebook
Email
Notes
More
Share

“As Leibniz suggested, we appear to live in the best of all possible worlds, where the computable functions make life predictable enough to be survivable, while the uncomputable functions make life (and mathematical truth) unpredictable enough to remain interesting, no matter how far computers continue to advance”—George Dyson

We all remember learning that the decimals of pi are infinite in number, 3.14159265359… Some of us even recall learning that you can approximate upper and lower bounds on the value of π to as high of a degree as you want by measuring the sides of polygons. As the number of sides of the polygon approach infinity and the length of their sides approach zero, your approximation gets better.

Archimedes (c. 287- 212) invented this early ‘polygonal algorithm’, which dominated for over 1,000 years as the most efficient way of computing π to any desired precision. The very primitive and geometric algorithmic function serves the purpose of estimating a real number, pi, whos…

Keep reading with a 7-day free trial

Subscribe to Privatdozent to keep reading this post and get 7 days of free access to the full post archives.

Already a paid subscriber? Sign in
© 2025 Privatdozent
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture

Share

Copy link
Facebook
Email
Notes
More