In this paper, we deal with the computation of Lie derivatives, which are required, for example, in some numerical methods for the solution of differential equations. One common way for computing them is to use symbolic computation. Computer algebra software, however, might fail if the function is complicated, and cannot be even performed if an explicit formulation of the function is not available, but we have only an algorithm for its computation. An alternative way to address the problem is to (...) use automatic differentiation. In this case, we only need the implementation of the algorithm that evaluates the function in terms of its analytic expression in a programming language, but we cannot use this if we have only a compiled version of the function. In this paper, we present a novel approach for calculating the Lie derivative of a function, even in the case where its analytical expression is not available, that is based on the In finity Computer arithmetic. A comparison with symbolic and automatic differentiation shows the potentiality of the proposed technique. (shrink)

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 able to work numerically with finite, infinite, and infinitesimal numbers giving so the possibility to use different infinitesimals numerically and, in particular, to take advantage of infinitesimal values of h. To show the potential of the new framework a number of results is established. It is proved that the Infinity Computer is able to calculate derivatives of the solution y(x) and to reconstruct its Taylor expansion of a desired order numerically without finding the respective derivatives analytically (or symbolically) by the successive derivation of the ODE as it is usually done when the Taylor method is applied. Methods using approximations of derivatives obtained thanks to infinitesimals are discussed and a technique for an automatic control of rounding errors is introduced. Numerical examples are given. (shrink)

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 to calculate values of derivatives of a higher order for a wide class of functions represented by computer procedures. It is shown that the ability to compute derivatives of arbitrary order automatically and accurate to working precision is an intrinsic property of the Infinity Computer related to its way of functioning. Numerical examples illustrating the new concepts and numerical tools are given. (shrink)

New algorithms for the numerical solution of Ordinary Differential Equations (ODEs) with initial condition are proposed. They are designed for work on a new kind of a supercomputer – the Infinity Computer, – that is able to deal numerically with finite, infinite and infinitesimal numbers. Due to this fact, the Infinity Computer allows one to calculate the exact derivatives of functions using infinitesimal values of the stepsize. As a consequence, the new methods described in this paper are able (...) to work with the exact values of the derivatives, instead of their approximations. (shrink)

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 contradict Cantor. In contrast, it can be viewed as an evolution of his deep ideas regarding the existence of different infinite numbers in a more applied way. Site percolation and gradient percolation have been studied by applying the new computational tools. It has been established that in an infinite system the phase transition point is not really a point as with respect of traditional approach. In light of new arithmetic it appears as a critical interval, rather than a critical point. Depending on “microscope” we use this interval could be regarded as finite, infinite and infinitesimal short interval. Using new approach we observed that in vicinity of percolation threshold we have many different infinite clusters instead of one infinite cluster that appears in traditional consideration. (shrink)

A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional (...) methodologies studying infinities and infinitesimals only symbolically. The grossone methodology uses the Euclid’s Common Notion no. 5 ‘The whole is greater than the part’ and applies it to finite, infinite, and infinitesimal quantities and to finite and infinite sets and processes. It does not contradict Cantor’s and non-standard analysis views on infinity and can be considered as an applied development of their ideas. In this paper we consider infinite series and a particular attention is dedicated to divergent series with alternate signs. The Riemann series theorem states that conditionally convergent series can be rearranged in such a way that they either diverge or converge to an arbitrary real number. It is shown here that Riemann’s result is a consequence of the fact that symbol ∞ used traditionally does not allow us to express quantitatively the number of addends in the series, in other words, it just shows that the number of summands is infinite and does not allows us to count them. The usage of the grossone methodology allows us to see that (as it happens in the case where the number of addends is finite) rearrangements do not change the result for any sum with a fixed infinite number of summands. There are considered some traditional summation techniques such as Ramanujan summation producing results where to divergent series containing infinitely many positive integers negative results are assigned. It is shown that the careful counting of the number of addends in infinite series allows us to avoid this kind of results if grossone-based numerals are used. (shrink)

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. (shrink)

A recently developed computational methodology for executing numerical calculations with infinities and infinitesimals is described in this paper. The approach developed has a pronounced applied character and is based on the principle “The part is less than the whole” introduced by the ancient Greeks. This principle is applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The point of view on infinities and infinitesimals (and in general, on Mathematics) presented in this paper (...) uses strongly physical ideas emphasizing interrelations that hold between a mathematical object under observation and the tools used for this observation. It is shown how a new numeral system allowing one to express different infinite and infinitesimal quantities in a unique framework can be used for theoretical and computational purposes. Numerous examples dealing with infinite sets, divergent series, limits, and probability theory are given. (shrink)

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer – the Infinity Computer – able to work with all these types of numbers. The new computational tools both give possibilities (...) to execute computations of a new type and open new horizons for creating new mathematical models where a computational usage of infinite and/or infinitesimal numbers can be useful. A number of numerical examples showing the potential of the new approach and dealing with divergent series, limits, probability theory, linear algebra, and calculation of volumes of objects consisting of parts of different dimensions are given. (shrink)

Two strategies to infinity are equally relevant for it is as universal and thus complete as open and thus incomplete. Quantum mechanics is forced to introduce infinity implicitly by Hilbert space, on which is founded its formalism. One can demonstrate that essential properties of quantum information, entanglement, and quantum computer originate directly from infinity once it is involved in quantum mechanics. Thus, thеse phenomena can be elucidated as both complete and incomplete, after which choice is the border (...) between them. A special kind of invariance to the axiom of choice shared by quantum mechanics is discussed to be involved that border between the completeness and incompleteness of infinity in a consistent way. The so-called paradox of Albert Einstein, Boris Podolsky, and Nathan Rosen is interpreted entirely in the same terms only of set theory. Quantum computer can demonstrate especially clearly the privilege of the internal position, or “observer”, or “user” to infinity implied by Henkin’s proposition as the only consistent ones as to infinity. (shrink)

In this article, some classical paradoxes of infinity such as Galileo’s paradox, Hilbert’s paradox of the Grand Hotel, Thomson’s lamp paradox, and the rectangle paradox of Torricelli are considered. In addition, three paradoxes regarding divergent series and a new paradox dealing with multiplication of elements of an infinite set are also described. It is shown that the surprising counting system of an Amazonian tribe, Pirah ̃a, working with only three numerals (one, two, many) can help us to change our (...) perception of these paradoxes. A recently introduced methodology allowing one to work with finite, infinite, and infinitesimal numbers in a unique computational framework not only theoretically but also numerically is briefly described. This methodology is actively used nowadays in numerous applications in pure and applied mathematics and computer science as well as in teaching. It is shown in the article that this methodology also allows one to consider the paradoxes listed above in a new constructive light. (shrink)

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. (...) How can we quantify what do these words, more precious, mean? Can we introduce a counter that for any possible number of medals would allow us to compute a numerical rank of a country using the number of gold, silver, and bronze medals in such a way that the higher resulting number would put the country in the higher position in the rank? Here we show that it is impossible to solve this problem using the positional numeral system with any finite base. Then we demonstrate that this problem can be easily solved by applying numerical computations with recently developed actual infinite numbers. These computations can be done on a new kind of a computer – the recently patented Infinity Computer. Its working software prototype is described briefly and examples of computations are given. It is shown that the new way of counting can be used in all situations where the lexicographic ordering is required. (shrink)

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 (...) notions and proposes a more physical treatment of mathematical objects separating the objects from tools used to study them. It both offers a possibility to create new numerical methods using infinities and infinitesimals in floating-point computations and allows one to study certain mathematical objects dealing with infinity more accurately than it is done traditionally. In these notes, we explain that even though both methodologies deal with infinities and infinitesimals, they are independent and represent two different philosophies of Mathematics that are not in a conflict. It is proved that texts :539–555, 2017; Gutman and Kutateladze in Sib Math J 49:835–841, 2008; Kutateladze in J Appl Ind Math 5:73–75, 2011) asserting that the ①-based methodology is a part of non-standard analysis unfortunately contain several logical fallacies. Their attempt to show that the ①-based methodology can be formalized within non-standard analysis is similar to trying to show that constructivism can be reduced to the traditional Mathematics. (shrink)

At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is like (...) many other scientific theories, in particular the first theories of both mechanical machines and heat machines. A more accurate examination of Theory of Computation shows a difference from the above mentioned theories in its essentially including an odd notion, “thesis”, to which no theorem corresponds. On the other hand, arguments of each of the other theories conclude a doubly negative predicate which then, by applying the inverse translation of the ‘negative one’, is translated into the corresponding affirmative predicate. By also taking into account three criticisms to the current Theory of Computation a rational re-formulation of it is sketched out; to Turing-Church thesis of the usual theory corresponds a similar proposition, yet connecting physical total computation functions with constructive mathematical total computation functions. -/- . (shrink)

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 (...) new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given. (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

The paper addresses Leon Hen.kin's proposition as a " lighthouse", which can elucidate a vast territory of knowledge uniformly: logic, set theory, information theory, and quantum mechanics: Two strategies to infinity are equally relevant for it is as universal and t hus complete as open and thus incomplete. Henkin's, Godel's, Robert Jeroslow's, and Hartley Rogers' proposition are reformulated so that both completeness and incompleteness to be unified and thus reduced as a joint property of infinity and of all (...) infinite sets. However, only Henkin's proposition equivalent to an internal position to infinity is consistent . This can be retraced back to set theory and its axioms, where that of choice is a key. Quantum mechanics is forced to introduce infinity implicitly by Hilbert space, on which is founded its formalism. One can demonstrate that some essential properties of quantum information, entanglement, and quantum computer originate directly from infinity once it is involved in quantum mechanics. Thus, these phenomena can be elucidated as both complete and incomplete, after which choice is the border between them. A special kind of invariance to the axiom of choice shared by quantum mechanics is discussed to be involved that border between the completeness and incompleteness of infinity in a consistent way. The so-called paradox of Albert Einstein, Boris Podolsky, and Nathan Rosen is interpreted entirely in the same terms only of set theory. Quantum computer can demonstrate especially clearly the privilege of the internal position, or " observer'' , or "user" to infinity implied by Henkin's proposition as the only consistent ones as to infinity. An essential area of contemporary knowledge may be synthesized from a single viewpoint. (shrink)

To improve the riding performance and levitation stability of a high‐speed magnetic levitation (maglev) train, a control strategy based on mixed H 2/H4 with regional pole placement and model‐reference controllers are proposed. First, the nonlinear maglev train model is established, then the proposed system is designed to observe the movement of a suspension frame and a control strategy based on mixed H 2/H4 with regional pole placement and model‐reference control method are proposed. Test and analysis of the proposed system has (...) been done using MATLAB toolbox for train levitation height, velocity and current consume. Comparative simulation results show that the mixed H 2/H4 with regional pole placement control strategy has a better performance under the condition of step and random train levitation height. (shrink)

A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in (...) its memory not only finite numbers but also infinite and infinitesimal ones. (shrink)

Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. In this paper, Lexicographic Multi-Objective Linear Programming (LMOLP) problems are considered. To tackle them, traditional approaches either require solution of a series of linear programming problems or apply a scalarization of (...) weighted multiple objectives into a single-objective function. The latter approach requires finding a set of weights that guarantees the equivalence of the original problem and the single-objective one and the search of correct weights can be very time consuming. In this work a new approach for solving LMOLP problems using a recently introduced computational methodology allowing one to work numerically with infinities and infinitesimals is proposed. It is shown that a smart application of infinitesimal weights allows one to construct a single-objective problem avoiding the necessity to determine finite weights. The equivalence between the original multi-objective problem and the new single-objective one is proved. A simplex-based algorithm working with finite and infinitesimal numbers is proposed, implemented, and discussed. Results of some numerical experiments are provided. (shrink)

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer (...) might implement the idea of "infinite calculation" is the main subject. (shrink)

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 EU. It is revealed in the paper that at infinity the snowflake is not unique, i.e., different snowflakes can be distinguished for different infinite numbers of steps executed during the process of their generation. It is then shown that for any given infinite number n of steps it becomes possible to calculate the exact infinite number, Nn, of sides of the snowflake, the exact infinitesimal length, Ln, of each side and the exact infinite perimeter, Pn, of the Koch snowflake as the result of multiplication of the infinite Nn by the infinitesimal Ln. It is established that for different infinite n and k the infinite perimeters Pn and Pk are also different and the difference can be infinite. It is shown that the finite areas An and Ak of the snowflakes can be also calculated exactly (up to infinitesimals) for different infinite n and k and the difference An − Ak results to be infinitesimal. Finally, snowflakes constructed starting from different initial conditions are also studied and their quantitative characteristics at infinity are computed. (shrink)

The goal of this paper consists of developing a new (more physical and numerical in comparison with standard and non-standard analysis approaches) point of view on Calculus with functions assuming infinite and infinitesimal values. It uses recently introduced infinite and infinitesimal numbers being in accordance with the principle ‘The part is less than the whole’ observed in the physical world around us. These numbers have a strong practical advantage with respect to traditional approaches: they are representable at a new kind (...) of a computer – the Infinity Computer – able to work numerically with all of them. An introduction to the theory of physical and mathematical continuity and differentiation (including subdifferentials) for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains is developed in the paper. This theory allows one to work with derivatives that can assume not only finite but infinite and infinitesimal values, as well. It is emphasized that the newly introduced notion of the physical continuity allows one to see the same mathematical object as a continuous or a discrete one, in dependence on the wish of the researcher, i.e., as it happens in the physical world where the same object can be viewed as a continuous or a discrete in dependence on the instrument of the observation used by the researcher. Connections between pure mathematical concepts and their computational realizations are continuously emphasized through the text. Numerous examples are given. (shrink)

The paper considers a new type of objects – blinking fractals – that are not covered by traditional theories studying dynamics of self-similarity processes. It is shown that the new approach allows one to give various quantitative characteristics of the newly introduced and traditional fractals using infinite and infinitesimal numbers proposed recently. In this connection, the problem of the mathematical modelling of continuity is discussed in detail. A strong advantage of the introduced computational paradigm consists of its well-marked numerical character (...) and its own instrument – Infinity Computer – able to execute operations with infinite and infinitesimal numbers. (shrink)

Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines. We introduce IMs and describe some of their physical and psychological aspects. An accelerating Turing machine (an ATM) is a Turing machine that performs every next operation twice as fast. It can carry out infinitely many operations in finite time. Many ATMs can (...) be connected together to form networks of infinitely powerful agents. A network of ATMs can also be thought of as the control system for an infinitely complex robot. We describe a robot with a dense network of ATMs for its retinas, its brain, and its motor controllers. Such a robot can perform psychological supertasks - it can perceive infinitely detailed objects in all their detail; it can formulate infinite plans; it can make infinitely precise movements. An endless hierarchy of IMs might realize a deep notion of intelligent computing everywhere. (shrink)

Ordinal polytheism is motivated by the cosmological and design arguments. It is also motivated by Leibnizian–Lewisian modal realism. Just as there are many universes, so there are many gods. Gods are necessary concrete grounds of universes. The god-universe relation is one-to-one. Ordinal polytheism argues for a hierarchy of ranks of ever more perfect gods, one rank for every ordinal number. Since there are no maximally perfect gods, ordinal polytheism avoids many of the familiar problems of monotheism. It links theology with (...) counterpart theory, mathematics and computer science. And it entails that the system of universes has an attractive axiological structure. (shrink)

The book is devoted to the contemporary stage of quantum mechanics – quantum information, and especially to its philosophical interpretation and comprehension: the first one of a series monographs about the philosophy of quantum information. The second will consider Be l l ’ s inequalities, their modified variants and similar to them relations. The beginning of quantum information was in the thirties of the last century. Its speed development has started over the last two decades. The main phenomenon is entanglement. (...) The subareas are quantum computer, quantum communication (and teleportation), and quantum cryptography. The book offers the following main conceptions, theses and hypotheses: – dualistic Phythagoreanism as a new kind among the interpretations of quantum mechanics and information: arithmetical, logical, and metamathematical one; – Gödel ’ s first incompleteness theorem is an undecidable proposition, and consequently the second one,too. – a partial rehabilitation of Hilbert ’ s program for the self-foundation of mathematics; – the dual-foundation of mathematics; – Skolemian relativity between: Cantor ’s kinds of infinity, finiteness and infinity, discreteness and continuity, completeness and incompleteness, etc.; – information is a physical quantity representing the non-reducibility of a system to its parts, particularly nonaddtivity; – there exist pure relations «by itself», which cannot be reduced to predications; – energy conservation can and should be generalized; – Einstein’ s «general covariance» or «principle of relativity» can and should be generalized to cover discrete morphisms where the notion of velocity does not make sense. (shrink)

Due to the wide scope of (in particular linear) homotopy type theory (using quantum natural language processing), a metatheory can be applied not just to theorizing the metatheory of scientific progress, but ordinary language or any public language defined by sociality/social agents as the precondition for the realizability of (general) intelligence via an inferential network from which judgement can be made. How this metatheory of science generalizes to public language is through the recent advances of quantum natural language processing, but (...) the traditional metalogical encodings (of Tarski) is relatively comparable through universes such as the type of types or type of types of types found in the inherent inferentialism of UF/HoTT via infinity-groupoids. The "computational trinity" of proofs=programs=algebra in HoTT also means reason is defined functionally as "what it does" by what it computes (proofs are programs). Following Reza Negarestani's recent book, through the self's self-realizability, achieving self-consciousness and consciousness beyond selfhood, "geistig manifestation" is achieved in the form of general intelligence, but only through an inferential network of social agents intrinsically encoded through computation. (shrink)

This essay for the inaugural issue of Technology and Language discusses the problem of finding an optimal form of human-machine communication. In the ongoing search for an alien mind, humanity seems to find it not in the infinities of space, but in its own environment. Changes in the language of human-machine interaction made it understandable not only to trained specialists but to every household. In the course of time, home appliances and devices have developed their language abilities even more and (...) reached a very advanced level – by way of status indicators, displays, emergency sound and color signals. The transition to computer-assisted communication brought about a great diversity of human expression forms translated into the discrete digital language of technologies. According to some prognoses, the first human-robot marriage might be registered in the future, however, such a union is not the only possible human-machine alliance. (shrink)

This book is my gift to Albert Einstein on the occasion of his 142nd birthday - and is also a gift to everybody in the world he helped to shape! -/- My book adopts the view that the universe is infinite and eternal - but scientifically created. This paradox of creating eternity depends on the advanced electronics developed by future humanity. Those humans will develop time travel, plus programs that use "imaginary" time and infinite numbers like pi. They'll also become (...) the El or Elohim (names used by various religions to mean "God" or "the gods"). As astronomer Carl Sagan wrote in "Pale Blue Dot", "Many religions teach that it is the goal of humans to become gods." (I think that Elohim would be termed supernatural today, though their infinite abilities are actually natural outcomes of progress.) -/- A look through the book will tell you that some ideas are frequently repeated. This is because each article is meant to be understood without reading the others … so the same ideas show up in more than one. I’ve tried to stay away from jargon and equations unless they’re necessary (I find that they often make a subject harder to understand, not easier). All objects and events on Earth, in space, and in time (including the inevitability of world peace and immortality) are just one thing – strings of electronics' binary digits 1 and 0. -/- -/- TABLE OF CONTENTS -/- CHAPTER 1 - HYPOTHESIS OF QUANTUM GRAVITY -/- CHAPTER 2 - THE PHYSICIST AND THE PHILOSOPHER -/- CHAPTER 3 - ATTENTION MEDICAL DOCTORS! PHYSICS THEORY IMPLIES ALL PATIENTS CAN BE NORMALISED USING GRAVITY -/- CHAPTER 4 - SETI, EVOLUTION, AND TIME -/- CHAPTER 5 - ANYONS - ONE KEY TO UNLOCK GRAVITATIONAL-ELECTROMAGNETIC UNION, THE TOPOLOGICAL UNIVERSE, SPACE-TIME TRAVEL, FUTURE COMPUTERS, DARK MATTER/DARK ENERGY -/- CHAPTER 6 - WHAT CAUSES THE PLANETS TO SPEED UP AND SLOW DOWN WHILE THEY ARE ORBITING THE SUN -/- CHAPTER 7 - A BRIEF OUTLINE OF THE POSSIBLE BASICS OF COSMOLOGY IN THE 22nd CENTURY, AND WHAT IT MEANS FOR RELIGION -/- CHAPTER 8 - THE WORLD'S REAL-LIFE EXPERIMENTS WITH COVID-19 AND PHYSICS ALTER SOCIETY AND GLOBAL ECONOMICS -/- CHAPTER 9 - UNITING TIME -/- CHAPTER 10 - EXTRACTING ENERGY FROM BLACK HOLES -/- CHAPTER 11 - TIME TREK: THE 25TH CENTURY'S ANSWER TO STAR TREK. (shrink)

Renaissance philosopher, mathematician, and theologian Nicholas of Cusa (1401-1464) said that there is no proportion between the finite mind and the infinite. He is fond of saying reason cannot fully comprehend the infinite. That our best hope for attaining a vision and understanding of infinite things is by mathematics and by the use of contemplating symbols, which help us grasp "the absolute infinite". By the late 19th century, there is a decisive intervention in mathematics and its philosophy: the philosophical mathematician (...) Georg Cantor (1845-1918) says that between the realm of the finite and the absolute infinite, there is an intermediate realm partaking in properties in a certain sense of both the finite and the infinite: the transfinite realm. Like the finite, the transfinite realm is a realm of mathematical objects, numbers, and knowledge. Like the absolute infinite, the transfinite is a form of infinity insofar as transfinite sets and numbers transcend any finite number. Echoing Cusanus and neo-Platonism, Cantor says that the transfinite sequence of all ordinals is a symbol of the absolutely infinite, that is, God. This paper considers how the doctrine of symbolism and the philosophers' different commitments to the laws of logic, especially the Law of Non-Contradiction (LNC), enables these thinkers to articulate a transcendental apophatic approach to divinity. (shrink)

This introduction to the roles infinity plays in metaphysics includes discussion of the nature of infinity itself; infinite space and time, both in extent and in divisibility; infinite regresses; and a list of some other topics in metaphysics where infinity plays a significant role.

In this paper I present a novel supertask in a Newtonian universe that destroys and creates infinite masses and energies, showing thereby that we can have infinite indeterminism. Previous supertasks have managed only to destroy or create finite masses and energies, thereby giving cases of only finite indeterminism. In the Nothing from Infinity paradox we will see an infinitude of finite masses and an infinitude of energy disappear entirely, and do so despite the conservation of energy in all collisions. (...) I then show how this leads to the Infinity from Nothing paradox, in which we have the spontaneous eruption of infinite mass and energy out of nothing. I conclude by showing how our supertask models at least something of an old conundrum, the question of what happens when the immovable object meets the irresistible force. (shrink)

(1st draft for review) -/- WARNING: -/- Reading this book comes with certain dangers to be mindful of; Please consider the following suggestions to avoid them: -/- 1: Do not try to perceive infinity; Any kind of success here leads to psychosis. 2: Do not try to resolve the paradoxes; To understand the greater truth of this book, paradoxes must be accepted as true. 3: Do not read this book if your faith is unstable and having it challenged could (...) potentially put you into existential crisis. (shrink)

Bowin begins with an apparent paradox about Aristotelian infinity: Aristotle clearly says that infinity exists only potentially and not actually. However, Aristotle appears to say two different things about the nature of that potential existence. On the one hand, he seems to say that the potentiality is like that of a process that might occur but isn't right now. Aristotle uses the Olympics as an example: they might be occurring, but they aren't just now. On the other hand, (...) Aristotle says that infinity "exists in actuality as a process that is now occurring" (234). Bowin makes clear that Aristotle doesn't explicitly solve this problem, so we are left to work out the best reading we can. His proposed solution is that "infinity must be...a per se accident...of number and magnitude" (250). (Bryn Mawr Classical Review 2008.07.47). (shrink)

Argument mapping is a way of diagramming the logical structure of an argument to explicitly and concisely represent reasoning. The use of argument mapping in critical thinking instruction has increased dramatically in recent decades. This paper overviews the innovation and provides a procedural approach for new teaches wanting to use argument mapping in the classroom. A brief history of argument mapping is provided at the end of this paper.

This chapter draws an analogy between computing mechanisms and autopoietic systems, focusing on the non-representational status of both kinds of system (computational and autopoietic). It will be argued that the role played by input and output components in a computing mechanism closely resembles the relationship between an autopoietic system and its environment, and in this sense differs from the classical understanding of inputs and outputs. The analogy helps to make sense of why we should think of computing mechanisms as non-representational, (...) and might also facilitate reconciliation between computational and autopoietic/enactive approaches to the study of cognition. (shrink)

This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed for the (...) potential information of the world to actualize. Starting from the definition of information as the difference in one physical system that makes a difference in another physical system – which combines Bateson and Hewitt’s definitions, the argument is advanced for natural computation as a computational model of the dynamics of the physical world, where information processing is constantly going on, on a variety of levels of organization. This setting helps us to elucidate the relationships between computation, information, agency and cognition, within the common conceptual framework, with special relevance for biology and robotics. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

I advance a novel interpretation of Kant's argument that our original representation of space must be intuitive, according to which the intuitive status of spatial representation is secured by its infinitary structure. I defend a conception of intuitive representation as what must be given to the mind in order to be thought at all. Discursive representation, as modelled on the specific division of a highest genus into species, cannot account for infinite complexity. Because we represent space as infinitely complex, the (...) spatial manifold cannot be generated discursively and must therefore be given to the mind, i.e. represented in intuition. (shrink)

Economies are complicated systems encompassing micro behaviors, interaction patterns, and global regularities. Whether partial or general in scope, studies of economic systems must consider how to handle difficult real-world aspects such as asymmetric information, imperfect competition, strategic interaction, collective learning, and the possibility of multiple equilibria. Recent advances in analytical and computational tools are permitting new approaches to the quantitative study of these aspects. One such approach is Agent-based Computational Economics (ACE), the computational study of economic processes modeled as dynamic (...) systems of interacting agents. This chapter explores the potential advantages and disadvantages of ACE for the study of economic systems. General points are concretely illustrated using an ACE model of a two-sector decentralized market economy. Six issues are highlighted: Constructive understanding of production, pricing, and trade processes; the essential primacy of survival; strategic rivalry and market power; behavioral uncertainty and learning; the role of conventions and organizations; and the complex interactions among structural attributes, institutional arrangements, and behavioral dispositions. (shrink)

Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and for this reason, difficult (...) to pin down exactly. I claim that MR is of little importance for defending computationalism, and argue that it should rather appeal to organizational invariance or substrate neutrality of computation, which are much more intuitive but cannot support strong antireductionist arguments. (shrink)

Aristotle is said to have held that any kind of actual infinity is impossible. I argue that he was a finitist (or "potentialist") about _magnitude_, but not about _plurality_. He did not deny that there are, or can be, infinitely many things in actuality. If this is right, then it has implications for Aristotle's views about the metaphysics of parts and points.

According to infinitism, all justification comes from an infinite series of reasons. Peter Klein defends infinitism as the correct solution to the regress problem by rejecting two alternative solutions: foundationalism and coherentism. I focus on Klein's argument against foundationalism, which relies on the premise that there is no justification without meta-justification. This premise is incompatible with dogmatic foundationalism as defended by Michael Huemer and Time Pryor. It does not, however, conflict with non-dogmatic foundationalism. Whereas dogmatic foundationalism rejects the need for (...) any form of meta-justification, non-dogmatic foundationalism merely rejects Laurence BonJour's claim that meta-justification must come from beliefs. Unlike its dogmatic counterpart, non-dogmatic foundationalism can allow for basic beliefs to receive meta-justification from non-doxastic sources such as experiences and memories. Construed thus, non-dogmatic foundationalism is compatible with Klein's principle that there is no justification without meta-justification. I conclude that Klein's rejection of foundationalism. fails. Nevertheless, I agree with Klein that when in response to a skeptical challenge we engage in the activity of defending our beliefs, the number of reasons we can give is at least in principle infinite. I argue that this type of infinity is benign because, when we continue to give reasons, we will eventually merely repeat previously stated reasons. Consequently, I reject Klein's claim that the more reasons we give the more we increase the justification of our beliefs. (shrink)

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second recursion theorem, I prove (...) that it is mathematically possible for us to be in a simulation that is being run on a computer \textit{by us}. In such a case, there would be two identical instances of us; the question of which of those is ``really us'' is meaningless. I also show how Rice's theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; briefly investigate the graphical structure of universes simulating universes simulating universes, among other issues. I end by describing some of the possible avenues for future research that this preliminary investigation reveals. (shrink)

It is often alleged that Cantor’s views about how the set theoretic universe as a whole should be considered are fundamentally unclear. In this article we argue that Cantor’s views on this subject, at least up until around 1896, are relatively clear, coherent, and interesting. We then go on to argue that Cantor’s views about the set theoretic universe as a whole have implications for theology that have hitherto not been sufficiently recognised. However, the theological implications in question, at least (...) as articulated here, would not have satisfied Cantor himself. (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds (...) to set-theory or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (shrink)

[EDIT: This book will be published open access. Check back around April 2024 to access the entire book.] One central aim of science is to provide explanations of natural phenomena. What role(s) does mathematics play in achieving this aim? How does mathematics contribute to the explanatory power of science? Rules to Infinity defends the thesis, common though perhaps inchoate among many members of the Vienna Circle, that mathematics contributes to the explanatory power of science by expressing conceptual rules, rules (...) which allow the transformation of empirical descriptions. Mathematics should not be thought of as describing, in any substantive sense, an abstract realm of eternal mathematical objects, as traditional platonists have thought. In Rules to Infinity, this view, which I call mathematical normativism, is updated with contemporary philosophical tools, and it is argued that normativism is compatible with mainstream semantic theory. This allows the normativist to accept that there are mathematical truths, while resisting the platonistic idea that there exist abstract mathematical objects that explain such truths. Furthermore, Rules to Infinity defends a particular account of the distinction between scientific explanations that are in some sense distinctively mathematical – those that explain natural phenomena in some uniquely mathematical way – and those that are only standardly mathematical, and it lays out desiderata for any account of this distinction. Normativism is compared with other prominent views in the philosophy of mathematics such as neo-Fregeanism, fictionalism, conventionalism, and structuralism. Rules to Infinity serves as an entry point into debates at the forefront of philosophy of science and mathematics, and it defends novel positions in these debates. (shrink)

This work deals with problems involving infinities and infinitesimals. It explores the ideas behind zero, its relationship to ontological nothingness, finititude (such as finite numbers and quantities), and the infinite. The idea of infinity and zero are closely related, despite what many perceive as an intuitive inverse relationship. The symbol 0 generally refers to nothingness, whereas the symbol infinity refers to ``so much'' that it cannot be quantified or captured. The notion of finititude rests somewhere between complete nothingness (...) and something having no end. -/- My concern is that many of the philosophers arguing for or against the ontology (or possibility) of an actual infinite set are unaware or unfamiliar with the mathematical literature attempting to clearly and rigorously define these terms. I believe it is a mistake to leave mathematicians out of this conversation, as analysts in particular have defined (and used) infinity in a way that is relevant to the ongoing debate between philosophers. -/- For this paper, I have selected examples from Principles of Analysis by Walter Rudin, which has become a standard text for Real Analysis classes taken by pure mathematicians and engineers. I will also restrict the scope of examples to Euclidean spaces for simplicity. Finally, I will be using addition, + and multiplication * in their usual way. (shrink)

This book addresses key conceptual issues relating to the modern scientific and engineering use of computer simulations. It analyses a broad set of questions, from the nature of computer simulations to their epistemological power, including the many scientific, social and ethics implications of using computer simulations. The book is written in an easily accessible narrative, one that weaves together philosophical questions and scientific technicalities. It will thus appeal equally to all academic scientists, engineers, and researchers in industry interested in questions (...) related to the general practice of computer simulations. (shrink)