Cheap Non-standard Analysis and Computability

April 25, 2018 ยท The Ethereal ยท ๐Ÿ› Symposium on Symbolic and Numeric Algorithms for Scientific Computing

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Olivier Bournez, Sabrina Ouazzani arXiv ID 1804.09746 Category cs.LO: Logic in CS Cross-listed cs.CL Citations 1 Venue Symposium on Symbolic and Numeric Algorithms for Scientific Computing Last Checked 5 months ago
Abstract
Non standard analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical analysis can be expressed very naturally. Cheap non-standard analysis introduced by Terence Tao in 2012 is based on the idea that considering that a property holds eventually is sufficient to give the essence of many of its statements. This provides constructivity but at some (acceptable) price. We consider computability in cheap non-standard analysis. We prove that many concepts from computable analysis as well as several concepts from computability can be very elegantly and alternatively presented in this framework. It provides a dual view and dual proofs to several statements already known in these fields.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS