In mathematics, Richardson's theorem establishes the undecidability of the equality of real numbers defined by expressions involving integers, pi, the natural logarithm base, and exponential and sine functions. It was proved in 1968 by mathematician and computer scientist Daniel Richardson of the University of Bath. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
In Branch
Source Wolfram MathWorld: Richardson's Theorem
Sources
1. Richardson's theorem (Wikipedia)
Lead paragraph
It was proved in 1968 by the mathematician and computer scientist Daniel Richardson
In Group: Computability and Complexity Theory, Lead section
In mathematics, Richardson's theorem establishes the undecidability of the equality of real numbers defined
View the SourceWolfram MathWorld: Richardson's Theorem
Wolfram MathWorldIn Branch: Logic and Foundations, Subject classificationsQuote, In Branch: Logic and Foundations, Subject classifications
Foundations of Mathematics Logic
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.