11 found
Order:
Disambiguations
Yaroslav Sergeyev [9]Yaroslav D. Sergeyev [2]
See also
Yaroslav Sergeyev
Università della Calabria
  1.  45
    Independence of the Grossone-Based Infinity Methodology From Non-Standard Analysis and Comments Upon Logical Fallacies in Some Texts Asserting the Opposite.Yaroslav D. Sergeyev - 2019 - Foundations of Science 24 (1):153-170.
    This paper considers non-standard analysis and a recently introduced computational methodology based on the notion of ①. The latter approach was developed with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework and in all the situations requiring these notions. Non-standard analysis is a classical purely symbolic technique that works with ultrafilters, external and internal sets, standard and non-standard numbers, etc. In its turn, the ①-based methodology does not use any of these (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Numerical Infinities and Infinitesimals: Methodology, Applications, and Repercussions on Two Hilbert Problems.Yaroslav Sergeyev - 2017 - EMS Surveys in Mathematical Sciences 4 (2):219–320.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  50
    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.
    The Koch snowflake is one of the first fractals that were mathematically described. It is interesting because it has an infinite perimeter in the limit but its limit area is finite. In this paper, a recently proposed computational methodology allowing one to execute numerical computations with infinities and infinitesimals is applied to study the Koch snowflake at infinity. Numerical computations with actual infinite and infinitesimal numbers can be executed on the Infinity Computer being a new supercomputer patented in USA and (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  46
    The Olympic Medals Ranks, Lexicographic Ordering and Numerical Infinities.Yaroslav Sergeyev - 2015 - The Mathematical Intelligencer 37 (2):4-8.
    Several ways used to rank countries with respect to medals won during Olympic Games are discussed. In particular, it is shown that the unofficial rank used by the Olympic Committee is the only rank that does not allow one to use a numerical counter for ranking – this rank uses the lexicographic ordering to rank countries: one gold medal is more precious than any number of silver medals and one silver medal is more precious than any number of bronze medals. (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  5. Solving Ordinary Differential Equations by Working with Infinitesimals Numerically on the Infinity Computer.Yaroslav Sergeyev - 2013 - Applied Mathematics and Computation 219 (22):10668–10681.
    There exists a huge number of numerical methods that iteratively construct approximations to the solution y(x) of an ordinary differential equation (ODE) y′(x) = f(x,y) starting from an initial value y_0=y(x_0) and using a finite approximation step h that influences the accuracy of the obtained approximation. In this paper, a new framework for solving ODEs is presented for a new kind of a computer – the Infinity Computer (it has been patented and its working prototype exists). The new computer is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Single-Tape and Multi-Tape Turing Machines Through the Lens of the Grossone Methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.
    The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the instrument (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Interpretation of Percolation in Terms of Infinity Computations.Yaroslav Sergeyev, Dmitri Iudin & Masaschi Hayakawa - 2012 - Applied Mathematics and Computation 218 (16):8099-8111.
    In this paper, a number of traditional models related to the percolation theory has been considered by means of new computational methodology that does not use Cantor’s ideas and describes infinite and infinitesimal numbers in accordance with the principle ‘The part is less than the whole’. It gives a possibility to work with finite, infinite, and infinitesimal quantities numerically by using a new kind of a compute - the Infinity Computer – introduced recently in [18]. The new approach does not (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  8. Higher Order Numerical Differentiation on the Infinity Computer.Yaroslav Sergeyev - 2011 - Optimization Letters 5 (4):575-585.
    There exist many applications where it is necessary to approximate numerically derivatives of a function which is given by a computer procedure. In particular, all the fields of optimization have a special interest in such a kind of information. In this paper, a new way to do this is presented for a new kind of a computer - the Infinity Computer - able to work numerically with finite, infinite, and infinitesimal number. It is proved that the Infinity Computer is able (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  9.  73
    Using Blinking Fractals for Mathematical Modelling of Processes of Growth in Biological Systems.Yaroslav Sergeyev - 2011 - Informatica 22 (4):559–576.
    Many biological processes and objects can be described by fractals. The paper uses a new type of objects – blinking fractals – that are not covered by traditional theories considering dynamics of self-similarity processes. It is shown that both traditional and blinking fractals can be successfully studied by a recent approach allowing one to work numerically with infinite and infinitesimal numbers. It is shown that blinking fractals can be applied for modeling complex processes of growth of biological systems including their (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  10. A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities.Yaroslav D. Sergeyev - 2008 - Informatica 19 (4):567-596.
    A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  11.  13
    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.
    The importance of the prime factorization problem is very well known (e.g., many security protocols are based on the impossibility of a fast factorization of integers on traditional computers). It is necessary from a number k to establish two primes a and b giving k = a · b. Usually, k is written in a positional numeral system. However, there exists a variety of numeral systems that can be used to represent numbers. Is it true that the prime factorization is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation