Timeline for Why can't proofs have infinitely many steps?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2010 at 12:24 | comment | added | Noam Zeilberger | And I think it's worth adding that this idea is still finding application in proof theory and computer science, where an "infinite proof" can be seen as just a way of speaking about a lazily computed object. See for example [linta.de/~aehlig/university/pub/08-proofnotation.pdf On the Computational Complexity of Cut-Reduction] by Aehlig and Beckmann, from LICS 2008. | |
| Aug 29, 2010 at 19:52 | history | answered | John Stillwell | CC BY-SA 2.5 |