Corpus ID: 13744098

Cheap Non-standard Analysis and Computability

@article{Bournez2018CheapNA,
  title={Cheap Non-standard Analysis and Computability},
  author={O. Bournez and S. Ouazzani},
  journal={ArXiv},
  year={2018},
  volume={abs/1804.09746}
}
  • O. Bournez, S. Ouazzani
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING

    Topics from this paper.

    Cheap Non-Standard Analysis and Computability: Some Applications

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES
    Complexity Theory of Real Functions
    • K. Ko
    • Mathematics, Computer Science
    • 1991
    • 498
    • PDF
    Computable analysis: an introduction
    • 806
    A Lightface Analysis of the differentiability rank
    • 3
    • PDF
    Higher Recursion Theory
    • 381
    Complexity and Real Computation
    • L. Blum
    • Computer Science, Mathematics
    • 1998
    • 1,366
    • PDF
    Elementary Calculus: An Infinitesimal Approach
    • 183
    Ranks of differentiable functions
    • 18