Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems

EMS Surveys in Mathematical Sciences 4 (2):219–320 (2017)
  Copy   BIBTEX

Abstract

In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the part” applied to all quantities (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The methodology uses a computational device called the Infinity Computer (patented in USA and EU) working numerically (recall that traditional theories work with infinities and infinitesimals only symbolically) with infinite and infinitesimal numbers that can be written in a positional numeral system with an infinite radix. It is argued that numeral systems involved in computations limit our capabilities to compute and lead to ambiguities in theoretical assertions, as well. The introduced methodology gives the possibility to use the same numeral system for measuring infinite sets, working with divergent series, probability, fractals, optimization problems, numerical differentiation, ODEs, etc. (recall that traditionally different numerals lemniscate; Aleph zero, etc. are used in different situations related to infinity). Numerous numerical examples and theoretical illustrations are given. The accuracy of the achieved results is continuously compared with those obtained by traditional tools used to work with infinities and infinitesimals. In particular, it is shown that the new approach allows one to observe mathematical objects involved in the Hypotheses of Continuum and the Riemann zeta function with a higher accuracy than it is done by traditional tools. It is stressed that the hardness of both problems is not related to their nature but is a consequence of the weakness of traditional numeral systems used to study them. It is shown that the introduced methodology and numeral system change our perception of the mathematical objects studied in the two problems.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Lagrange Lecture: Methodology of numerical computations with infinities and infinitesimals.Yaroslav Sergeyev - 2010 - Rendiconti Del Seminario Matematico dell'Università E Del Politecnico di Torino 68 (2):95–113.
The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area.Yaroslav Sergeyev - 2016 - Communications in Nonlinear Science and Numerical Simulation 31 (1-3):21–29.
Counting systems and the First Hilbert problem.Yaroslav Sergeyev - 2010 - Nonlinear Analysis Series A 72 (3-4):1701-1708.
The difficulty of prime factorization is a consequence of the positional numeral system.Yaroslav Sergeyev - 2016 - International Journal of Unconventional Computing 12 (5-6):453–463.
Infinitesimals: A Defense.Stacey Lynn Edgar - 1982 - Dissertation, Syracuse University
Philosophical Perspectives on Infinity.Graham Oppy - 2006 - New York: Cambridge University Press.

Analytics

Added to PP
2018-12-17

Downloads
941 (#15,112)

6 months
156 (#21,637)

Historical graph of downloads
How can I increase my downloads?