Timeline for Can non-computable real numbers be defined without making use of any notions from computability theory
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2015 at 20:52 | comment | added | Garabed Gulbenkian | My statement of the modified Lebesgue covering problem is not quite correct. It should read "What is the minimum (or greatest lower bound) of the set of diameters of plane convex sets that cover every plane set having diameter 1" | |
| Sep 22, 2015 at 20:42 | comment | added | Garabed Gulbenkian | Thanks for this reference. I will try to formulate some of these examples as geometric problems with specific real number solutions. | |
| Sep 21, 2015 at 19:54 | comment | added | Joel David Hamkins | See mathoverflow.net/q/11540/1946 for numerous examples of non-computable problems, each of which can be viewed as a non-computable real number (if one thinks of the binary digits), and most of those do not explicitly involve concepts from computability. Indeed, several of the problems, such as the tiling problems or the problems concerning manifolds and homotopy equivalence, have what might reasonably be deemed a geometric aspect. | |
| Sep 21, 2015 at 19:49 | history | asked | Garabed Gulbenkian | CC BY-SA 3.0 |