Related papers: The Mathematical Intelligencer flunks the Olympics
This paper introduces the concept of a generic finite set, and points out that a consistent and significant interpretation of the grossone notation of Yarolslav D. Sergeyev is that of a generic natural number. This means that the grossone…
The concepts of infinity and infinitesimal in mathematics date back to anciens Greek and have always attracted great attention. Very recently, a new methodology has been proposed by Sergeyev for performing calculations with infinite and…
A trivial formalization is given for the informal reasonings presented in a series of papers by Ya.D.Sergeyev on a positional numeral system with an infinitely large base, grossone; the system which is groundlessly opposed by its originator…
Prisoner's Dilemma (PD) is a widely studied game that plays an important role in Game Theory. This paper aims at extending PD Tournaments to the case of infinite, finite or infinitesimal payoffs using Sergeyev's Infinity Computing (IC). By…
In this paper, we look at how to count the number of elements of a set within the frame of Sergeyev's numeral system. We also look at the connection between the number of elements of a set and the notion of bijection in this new setting. We…
In this paper, we look at the improvement of our knowledge on a family of tilings of the hyperbolic plane which is brought in by the use of Sergeyev's numeral system based on grossone. It appears that the information we can get by using…
This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. This is camera-ready copy prepared for publication as a book, but at the last minute I decided to publish it…
The mathematical study of infinity seems to have the ability to transport the mind to lofty and unusual realms. Decades ago, I was transported in this way by Rudy Rucker's book Infinity and the Mind. Despite much subsequent learning and…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
Many historians of the calculus deny significant continuity between infinitesimal calculus of the 17th century and 20th century developments such as Robinson's theory. Robinson's hyperreals, while providing a consistent theory of…
In 1998, Fields medalist Stephen Smale [S. Smale, Mathematical problems for the next century, The mathematical Intelligencer, 20(2) (1998), 7-15] proposed his famous eighteen problems to the mathematicians of this century. The statement of…
In our previous arXiv papers (more systematically the informational conception is presented in the paper "The Information as Absolute", 2010) it was rigorously shown that Matter in our Universe - and Universe as a whole - are some…
How could we solve the machine learning and the artificial intelligence problem if we had infinite computation? Solomonoff induction and the reinforcement learning agent AIXI are proposed answers to this question. Both are known to be…
{\bf Abstract.} The present article is an essay about mathematical intuition and Artificial intelligence (A.I.), followed by a guided excursion to a well-known open problem. It has two objectives. The first is to reconcile the way of…
There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…
I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results…
I discuss some problems related to extreme mathematical realism, focusing on a recently proposed "shut-up-and-calculate" approach to physics (arXiv:0704.0646, arXiv:0709.4024). I offer arguments for a moderate alternative, the essence of…