Cheap Non-standard Analysis and Computability
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the Computability of Solomonoff Induction and Knowledge-Seeking
Solomonoff induction is held as a gold standard for learning, but it is known to be incomputable. We quantify its incomputability by placing various flavors of Solomonoff's prior M in the arithmetical hierarchy. We also …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Extending and Automating Basic Probability Theory with Propositional Computability Logic
Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, computability logic is built on the notion of …
Natural Language Semantics and Computability
This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logic…
How To Solve Moral Conundrums with Computability Theory
Various moral conundrums plague population ethics: the Non-Identity Problem, the Procreation Asymmetry, the Repugnant Conclusion, and more. I argue that the aforementioned moral conundrums have a structure neatly account…
EthicsPhilosophyImplementing Agent-Based Systems via Computability Logic CL2
Computability logic(CoL) is a powerful computational model. In this paper, we show that CoL naturally supports multi-agent programming models where resources (coffee for example) are involved. To be specific, we discuss …