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)

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)

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)

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)

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)

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)

The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, (...) has important implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set ( x )”. Then, equating Q ( x ) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (shrink)

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)

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)

This study examines problems related to the representation of music. It constructs the sender/message/perceiver/result model, a prototype broad enough to incorporate a large variety of music and other notation systems, including those having to do with computers. The work defines music notation itself, describes various models for studying the subject--including the binary types prescriptive/descriptive, and symbolic/iconic--and assesses music notation as a contemporary practice. It encompasses a review of the actions and intentions of composers, performers, and audiences, and a consideration of (...) the message and how it is affected by media , reference systems , and meanings. Finally, through an examination of the possibilities of the self acting as a notation system within models posited by feminist and queer theory, I attempt to demonstrate the power of notation to affect other systems and worlds, including the worlds of music, art, and politics. ;The consideration of these topics draws on theories from linguistics, semiotics, structuralism, post-structuralism, cybernetics, and music, as well as the philosophies of John Cage, Jean-Jacques Nattiez, Nelson Goodman, and others. The work examines various languages and applications used to program computers for musical purposes, though this examination does not incorporate programs dedicated exclusively to printing music. Nor does the study focus on non-Western notations, suggestions for reforms of notation, or encyclopedic lists of notation devices. ;The expository writing is augmented by excerpts from material I gathered in numerous interviews. There are separate sections containing interviews of Leonard Meyer, Allan Kaprow, John Cage, Earle Brown, Roger Reynolds, and Heidi von Gunden. There is also a large, partially-annotated bibliography. ;My hope is that an inclusive, interdisciplinary exploration of music notation will be useful in broadening the theoretical and creative boundaries of the field, as well as bridging gaps among musicians using various music technologies, and artists and theorists from diverse fields and perspectives. (shrink)

I discuss here the definition of computer simulations, and more specifically the views of Humphreys, who considers that an object is simulated when a computer provides a solution to a computational model, which in turn represents the object of interest. I argue that Humphreys's concepts are not able to analyse fully successfully a case of contemporary simulation in physics, which is more complex than the examples considered so far in the philosophical literature. I therefore modify Humphreys's definition of simulation. I (...) allow for several successive layers of computational models, and I discuss the relations that exist between these models, the computer, and the object under study. An aim of my proposal is to clarify the distinction between computational models and numerical methods, and to better understand the representational and the computational functions of models in simulations. (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)

Cloud Computing is a developing field and lean toward by numerous one at current yet it's rage is part more rely upon its execution which thusly is excessively rely upon the powerful booking algorithm and load adjusting . In this paper we address this issue and propose an algorithm for private cloud which has high throughput and for open cloud which address the issue of condition awareness likewise with execution. To enhance the throughput in private cloud SJF is utilized for (...) planning and to conquer shape the issue of starvation we utilize limited pausing. For stack adjusting we screen the heap and dispatch the activity to the minimum stacked VM. To acquire advantage and to have open door for future upgrade out in the open cloud condition cognizance is the key factor and for better execution and load adjusting likewise wanted. While stack adjusting enhances the execution, the earth awareness increment the benefit of cloud suppliers. (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)

The boundless nature of the natural numbers imposes paradoxically a high formal bound to the use of standard artificial computer programs for solving conceptually challenged problems in number theory. In the context of the new cognitive foundations for mathematics' and physics' program immersed in the setting of artificial mathematical intelligence, we proposed a refined numerical system, called the physical numbers, preserving most of the essential intuitions of the natural numbers. Even more, this new numerical structure additionally possesses the (...) property of being a bounded object allowing us to work with quite similar axioms like the classic Peano axioms, but in a finite environment and with an enriched physical dimension. Finally, we present several enlightening examples and we conclude that the physical numbers provide a natural formal setting for approaching classic problems in number theory from a more hybrid perspective, i.e. with a potential participation in the generation of solutions, not only of working mathematicians but also of more sophisticated artificial interactive (mathematical) intelligent agents (within the context of cognitive-computational metamathematics or artificial mathematical intelligence) and more controlled by physically-inspired principles. Finally, this paper addresses a highly new, bottom-up and paradigm-shifting approach to the foundations of physics: One should refine and improve the conceptual formal setting of the language that we use for understanding physical phenomena (e.g. the mathematical grounding concepts and theories) for being able to understand better more subtle and complex physical phenomena. (shrink)

Observable consequences of the hypothesis that the observed universe is a numerical simulation performed on a cubic space-time lattice or grid are explored. The simulation scenario is first motivated by extrapolating current trends in computational resource requirements for lattice QCD into the future. Using the historical development of lattice gauge theory technology as a guide, we assume that our universe is an early numerical simulation with unimproved Wilson fermion discretization and investigate potentially-observable consequences. Among the observables that are (...) considered are the muon g-2 and the current differences between determinations of alpha, but the most stringent bound on the inverse lattice spacing of the universe, b−1 > ~ 10^11 GeV, is derived from the high-energy cut off of the cosmic ray spectrum. The numerical simulation scenario could reveal itself in the distributions of the highest energy cosmic rays exhibiting a degree of rotational symmetry breaking that reflects the structure of the underlying lattice. (shrink)

What is philosophy of science? Numerous manuals, anthologies or essays provide carefully reconstructed vantage points on the discipline that have been gained through expert and piecemeal historical analyses. In this paper, we address the question from a complementary perspective: we target the content of one major journal of the field—Philosophy of Science—and apply unsupervised text-mining methods to its complete corpus, from its start in 1934 until 2015. By running topic-modeling algorithms over the full-text corpus, we identified 126 key research topics (...) that span across 82 years. We also tracked their evolution and fluctuating significance over time in the journal articles. Our results concur with and document known and lesser-known episodes of the philosophy of science, including the rise and fall of logic and language-related topics, the relative stability of a metaphysical and ontological questioning (space and time, causation, natural kinds, realism), the significance of epistemological issues about the nature of scientific knowledge as well as the rise of a recent philosophy of biology and other trends. These analyses exemplify how computational text-mining methods can be used to provide an empirical large-scale and data-driven perspective on the history of philosophy of science that is complementary to other current historical approaches. (shrink)

Community detection is a major issue in network analysis. This paper combines a socio-historical approach with an experimental reconstruction of programs to investigate the early automation of clique detection algorithms, which remains one of the unsolved NP-complete problems today. The research led by the archaeologist Jean-Claude Gardin from the 1950s on non-numerical information and graph analysis is retraced to demonstrate the early contributions of social sciences and humanities. The limited recognition and reception of Gardin's innovative computer application to the (...) humanities are addressed through two factors, in addition to the effects of historiography and bibliographies on the recording, discoverability, and reuse of scientific productions: (1) funding policies, evidenced by the transfer of research effort on graph applications from temporary interdisciplinary spaces to disciplinary organizations related to the then-emerging field of computer science; and (2) the erratic careers of algorithms, in which efficiency, flaws, corrections, and authors’ status, were determining factors. (shrink)

This dissertation is a contribution to formal and computational philosophy. -/- In the first part, we show that by exploiting the parallels between large, yet finite lotteries on the one hand and countably infinite lotteries on the other, we gain insights in the foundations of probability theory as well as in epistemology. Case 1: Infinite lotteries. We discuss how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. The solution boils down to the introduction (...) of infinitesimal probability values, which can be achieved using non-standard analysis. Our solution can be generalized to uncountable sample spaces, giving rise to a Non-Archimedean Probability (NAP) theory. Case 2: Large but finite lotteries. We propose application of the language of relative analysis (a type of non-standard analysis) to formulate a new model for rational belief, called Stratified Belief. This contextualist model seems well-suited to deal with a concept of beliefs based on probabilities ‘sufficiently close to unity’. -/- The second part presents a case study in social epistemology. We model a group of agents who update their opinions by averaging the opinions of other agents. Our main goal is to calculate the probability for an agent to end up in an inconsistent belief state due to updating. To that end, an analytical expression is given and evaluated numerically, both exactly and using statistical sampling. The probability of ending up in an inconsistent belief state turns out to be always smaller than 2%. (shrink)

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 (...) difficult in any numeral system? In this paper, a numeral system with partial carrying is described. It is shown that this system contains numerals allowing one to reduce the problem of prime factorization to solving [K/2] − 1 systems of equations, where K is the number of digits in k (the concept of digit in this system is more complex than the traditional one) and [u] is the integer part of u. Thus, it is shown that the difficulty of prime factorization is not in the problem itself but in the fact that the positional numeral system is used traditionally to represent numbers participating in the prime factorization. Obviously, this does not mean that P=NP since it is not known whether it is possible to re-write a number given in the traditional positional numeral system to the new one in a polynomial time. (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)

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)

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)

Computation is a process of making explicit, information that was implicit. In computing 5 as the solution to ∛125, for example, we move from a description that is not explicitly about 5 to one that is. We are drawing out numerical consequences to the description ∛125. We are extracting information implicit in the problem statement. Can we precisely state the difference between information thati s implicit in a state, structure or process and information that is explicit?

Artificial agents (AAs), particularly but not only those in Cyberspace, extend the class of entities that can be involved in moral situations. For they can be conceived of as moral patients (as entities that can be acted upon for good or evil) and also as moral agents (as entities that can perform actions, again for good or evil). In this paper, we clarify the concept of agent and go on to separate the concerns of morality and responsibility of agents (most (...) interestingly for us, of AAs). We conclude that there is substantial and important scope, particularly in Computer Ethics, for the concept of moral agent not necessarily exhibiting free will, mental states or responsibility. This complements the more traditional approach, common at least since Montaigne and Descartes, which considers whether or not (artificial) agents have mental states, feelings, emotions and so on. By focussing directly on mind-less morality we are able to avoid that question and also many of the concerns of Artificial Intelligence. A vital component in our approach is the Method of Abstraction for analysing the level of abstraction (LoA) at which an agent is considered to act. The LoA is determined by the way in which one chooses to describe, analyse and discuss a system and its context. The Method of Abstraction is explained in terms of an interface or set of features or observables at a given LoA. Agenthood, and in particular moral agenthood, depends on a LoA. Our guidelines for agenthood are: interactivity (response to stimulus by change of state), autonomy (ability to change state without stimulus) and adaptability (ability to change the transition rules by which state is changed) at a given LoA. Morality may be thought of as a threshold defined on the observables in the interface determining the LoA under consideration. An agent is morally good if its actions all respect that threshold; and it is morally evil if some action violates it. That view is particularly informative when the agent constitutes a software or digital system, and the observables are numerical. Finally we review the consequences for Computer Ethics of our approach. In conclusion, this approach facilitates the discussion of the morality of agents not only in Cyberspace but also in the biosphere, where animals can be considered moral agents without their having to display free will, emotions or mental states, and in social contexts, where systems like organizations can play the role of moral agents. The primary cost of this facility is the extension of the class of agents and moral agents to embrace AAs. (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)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as the Riemann hypothesis, have had to be considered in terms of the evidence for and against them. In recent decades, massive increases in computer power have permitted the gathering of huge amounts of numerical evidence, both for conjectures in pure mathematics (...) and for the behavior of complex applied mathematical models and statistical algorithms. Mathematics has therefore become (among other things) an experimental science (though that has not diminished the importance of proof in the traditional style). We examine how the evaluation of evidence for conjectures works in mathematical practice. We explain the (objective) Bayesian view of probability, which gives a theoretical framework for unifying evidence evaluation in science and law as well as in mathematics. Numerical evidence in mathematics is related to the problem of induction; the occurrence of straightforward inductive reasoning in the purely logical material of pure mathematics casts light on the nature of induction as well as of mathematical reasoning. (shrink)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics (...) or a prediction in numerical economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

The Gamer’s Dilemma consists of three intuitively plausible but conflicting assertions: (i) Virtual murder is morally permissible. (ii) Virtual child molestation is morally forbidden. (iii) There is no relevant moral difference between virtual murder and virtual child molestation in computer games. Numerous attempts to resolve (or dissolve) the Gamer’s Dilemma line the field of computer game ethics. Mostly, the phenomenon is approached using expressivist argumentation: Reprehensible virtual actions express something immoral in their performance but are not immoral by themselves. Consequentialists, (...) on the other hand, claim that the immorality of virtual actions arises from their harmful consequences. I argue that both approaches have serious difficulties meeting the moral challenge posed by the Gamer’s Dilemma. They tend to confuse the morality of in-game actions either with the morality of their real-world counterparts or with the morality of games as objects. Following this critical analysis, I will develop a Kantian argument and defend it against two objections. So far, deontological responses to the Gamer’s Dilemma have been sought in vain. Yet, with Kant, its moral challenge can be met by looking at the gamer’s reasons. From this perspective, the Gamer’s Dilemma is based on a false assumption: the moral status of gaming acts does not derive from a normative equation with their real-world counterparts but only from their justifications. (shrink)

Why would we want to develop artificial human-like arithmetical intelligence, when computers already outperform humans in arithmetical calculations? Aside from arithmetic consisting of much more than mere calculations, one suggested reason is that AI research can help us explain the development of human arithmetical cognition. Here I argue that this question needs to be studied already in the context of basic, non-symbolic, numerical cognition. Analyzing recent machine learning research on artificial neural networks, I show how AI studies could potentially (...) shed light on the development of human numerical abilities, from the proto-arithmetical abilities of subitizing and estimating to counting procedures. Although the current results are far from conclusive and much more work is needed, I argue that AI research should be included in the interdisciplinary toolbox when we try to explain the development and character of numerical cognition and arithmetical intelligence. This makes it relevant also for the epistemology of mathematics. (shrink)

We argue that the mathematization of science should be understood as a normative activity of advocating for a particular methodology with its own criteria for evaluating good research. As a case study, we examine the mathematization of taxonomic classification in systematic biology. We show how mathematization is a normative activity by contrasting its distinctive features in numerical taxonomy in the 1960s with an earlier reform advocated by Ernst Mayr starting in the 1940s. Both Mayr and the numerical taxonomists (...) sought to formalize the work of classification, but Mayr introduced a qualitative formalism based on human judgment for determining the taxonomic rank of populations, while the numerical taxonomists introduced a quantitative formalism based on automated procedures for computing classifications. The key contrast between Mayr and the numerical taxonomists is how they conceptualized the temporal structure of the workflow of classification, specifically where they allowed meta-level discourse about difficulties in producing the classification. (shrink)

Plant diseases are numerous in the world of agriculture. These diseases cause a lot of trouble to most farmers. Among these common diseases, we single out the diseases that affect the Passion fruit, which is affected by about seven diseases, with different symptoms for each disease. Today, technology is facilitating human life in all areas of life, and among these facilities are expert system, a computer program that uses artificial-intelligence methods to solve problems within a specialized domain that ordinarily requires (...) human expertise. The first expert system was developed in 1965 by Edward Feigen Baum and Joshua Lederberg of Stanford University in California, U.S. Dendral, as their expert system was later known, was designed to analyses chemical compounds. Expert systems now have commercial applications in fields as diverse as medical diagnosis, petroleum engineering, and financial investing and other areas, and with reference to expert systems and their importance to humans, an integrated expert system has been created in the agricultural field that diagnoses Passion diseases using CLIPS Expert System language. The system was used to design and implement the proposed expert system. The system facilitates the diagnosis of Passion -related diseases. There is no doubt that this expert system will help farmers and those involved in the agricultural field to diagnose Passion -related diseases. Objectives: is to help farmers diagnose Passion diseases in the correct way and how to treat these diseases. Method: The system contains a program project that diagnoses 7 diseases that affect Passion and the seven diseases are: Brown spot, Septoria spot, Root and crown rot, Fusarium wilt, Anthracnose, Woodiness virus, Scab. Results: The expert system was evaluated by farmers and praised for helping them with it. Conclusion: The expert system for diagnosing Passion diseases is effective and usable. (shrink)

In graph theory, the concept of domination is essential in a variety of domains. It has broad applications in diverse fields such as coding theory, computer net work models, and school bus routing and facility lo cation problems. If a fuzzy graph fails to obtain acceptable results, neutrosophic sets and neutrosophic graphs can be used to model uncertainty correlated with indeterminate and inconsistent information in arbitrary real-world scenario. In this study, we consider the concept of domination as it relates to (...) single-valued neutrosophic incidence graphs (SVNIGs). Given the importance of domination and its utilization in numerous fields, we propose the application of dominating sets in SVNIG with valid edges. We present some relevant definitions such as those of valid edges, cardinality, and isolated vertices in SVNIG along with some examples. Furthermore, we also show a few significant sets connected to the dominating set in an SVNIG such as independent and irredundant sets. We also investigate a relationship between the concepts of dominating sets and domination numbers as well as irredundant and independence sets in SVNIGs. Finally, a real-life deployment of domination in SVNIGsis investigated in relation to COVID-19 vaccination locations as a practical application. (shrink)

The conjunction of wireless computing, ubiquitous Internet access, and the miniaturisation of sensors have opened the door for technological applications that can monitor health and well-being outside of formal healthcare systems. The health-related Internet of Things (H-IoT) increasingly plays a key role in health management by providing real-time tele-monitoring of patients, testing of treatments, actuation of medical devices, and fitness and well-being monitoring. Given its numerous applications and proposed benefits, adoption by medical and social care institutions and consumers may be (...) rapid. However, a host of ethical concerns are also raised that must be addressed. The inherent sensitivity of health-related data being generated and latent risks of Internet-enabled devices pose serious challenges. Users, already in a vulnerable position as patients, face a seemingly impossible task to retain control over their data due to the scale, scope and complexity of systems that create, aggregate, and analyse personal health data. In response, the H-IoT must be designed to be technologically robust and scientifically reliable, while also remaining ethically responsible, trustworthy, and respectful of user rights and interests. To assist developers of the H-IoT, this paper describes nine principles and nine guidelines for ethical design of H-IoT devices and data protocols. (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)

For many employees, ‘work’ is no longer something performed while sitting at a computer in an office. Employees in a growing number of industries are expected to carry mobile devices and be available for work-related interactions even when beyond the workplace and outside of normal business hours. In this article it is argued that a future step will increasingly be to move work-related information and communication technology (ICT) inside the human body through the use of neuroprosthetics, to create employees who (...) are always ‘online’ and connected to their workplace’s digital ecosystems. At present, neural implants are used primarily to restore abilities lost through injury or illness, however their use for augmentative purposes is expected to grow, resulting in populations of human beings who possess technologically altered capacities for perception, memory, imagination, and the manipulation of physical environments and virtual cyberspace. Such workers may exchange thoughts and share knowledge within posthuman cybernetic networks that are inaccessible to unaugmented human beings. Scholars note that despite their potential benefits, such neuroprosthetic devices may create numerous problems for their users, including a sense of alienation, the threat of computer viruses and hacking, financial burdens, and legal questions surrounding ownership of intellectual property produced while using such implants. Moreover, different populations of human beings may eventually come to occupy irreconcilable digital ecosystems as some persons embrace neuroprosthetic technology, others feel coerced into augmenting their brains to compete within the economy, others might reject such technology, and still others will simply be unable to afford it. In this text we propose a model for analyzing how particular neuroprosthetic devices will either facilitate human beings’ participation in new forms of socioeconomic interaction and digital workplace ecosystems – or undermine their mental and physical health, privacy, autonomy, and authenticity. We then show how such a model can be used to create device ontologies and typologies that help us classify and understand different kinds of advanced neuroprosthetic devices according to the impact that they will have on individual human beings. (shrink)

In the 70 years since Alan Turing’s ‘Computing Machinery and Intelligence’ appeared in Mind, there have been two widely-accepted interpretations of the Turing test: the canonical behaviourist interpretation and the rival inductive or epistemic interpretation. These readings are based on Turing’s Mind paper; few seem aware that Turing described two other versions of the imitation game. I have argued that both readings are inconsistent with Turing’s 1948 and 1952 statements about intelligence, and fail to explain the design of his game. (...) I argue instead for a response-dependence interpretation. This interpretation has implications for Turing’s view of free will: I argue that Turing’s writings suggest a new form of free will compatibilism, which I call response-dependence compatibilism. The philosophical implications of rethinking Turing’s test go yet further. It is assumed by numerous theorists that Turing anticipated the computational theory of mind. On the contrary, I argue, his remarks on intelligence and free will lead to a new objection to computationalism. (shrink)

The modern computer environment has moved past the local data center with a single entry and exit point to a global network comprising many data centers and hundreds of entry and exit points, commonly referred as Cloud Computing, used by all possible devices with numerous entry and exit point for transactions, online processing, request and responses traveling across the network, making the ever complex networks even more complex, making traversing, monitoring and detecting threats over such an environment a big challenge (...) for Network forensic and investigation for cybercrimes. It has demanded in depth analysis using network tools and techniques to determine how best information can be extracted pertinent to an investigation. Data mining technique providing great aid in finding relevant clusters for predicting unusual activities, pattern matching and fraud detection in an environment, capable to deal with huge amount of data. The concept of network forensics in cloud computing requires a new mindset where some data will not be available, some data will be suspect, and some data will be court ready and can fit into the traditional network forensics model. From a network security viewpoint, all data traversing the cloud network backplane is visible and accessible by the cloud service provider. It is not possible to think now that one physical device will only have one operating system that needs to be taken down for investigation. Without the network forensics investigator, understanding the architecture of the cloud environment systems and possible compromises will be overlooked or missed. In this paper, we focus on the role of Network Forensic in a cloud environment, its mapping few of the available tools and contribution of Data Mining in making analysis, and also to bring out the challenges in this field. (shrink)

Slot machines gained a high popularity despite a specific element that could limit their appeal: non-transparency with respect to mathematical parameters. The PAR sheets, exposing the parameters of the design of slot machines and probabilities associated with the winning combinations are kept secret by game producers, and the lack of data regarding the configuration of a machine prevents people from computing probabilities and other mathematical indicators. In this article, I argue that there is no rational justification for this secrecy by (...) giving two reasons, one psychological and the other mathematical. For the latter, I show that mathematics provides us with some statistical methods of retrieving the missing data, which are essential for the numerical probability computations in slots. The slots case raises the problem of the exposure of the parametric configuration and mathematical facts of any game of chance as an ethical obligation. (shrink)

This paper is about the alethic aspect of epistemic rationality. The most common approaches to this aspect are either normative (what a reasoner ought to/may believe?) or evaluative (how rational is a reasoner?), where the evaluative approaches are usually comparative (one reasoner is assessed compared to another). These approaches often present problems with blindspots. For example, ought a reasoner to believe a currently true blindspot? Is she permitted to? Consequently, these approaches often fail in describing a situation of alethic maximality, (...) where a reasoner fulfills all the alethic norms and could be used as a standard of rationality (as they are, in fact, used in some of these approaches). I propose a function α, which accepts a set of beliefs as inputand returns a numeric alethic value. Then I use this function to define a notion of alethic maximality that is satisfiable by finite reasoners (reasoners with cognitive limitations) and does not present problems with blindspots. Function α may also be used in alethic norms and evaluation methods (comparative and non-comparative) that may be applied to finite reasoners and do not present problems with blindspots. A result of this investigation isthat the project of providing purely alethic norms is defective. The use of function α also sheds light on important epistemological issues, such as the lottery and the preface paradoxes, and the principles of clutter avoidance and reflection. (shrink)

PLEASE NOTE: This is the corrected 2nd eBook edition, 2021. ●●●●● _Critique of Impure Reason_ has now also been published in a printed edition. To reduce the otherwise high price of this scholarly, technical book of nearly 900 pages and make it more widely available beyond university libraries to individual readers, the non-profit publisher and the author have agreed to issue the printed edition at cost. ●●●●● The printed edition was released on September 1, 2021 and is now available through (...) all booksellers, including Barnes & Noble, Amazon, and brick-and-mortar bookstores under ISBN 978-0-578-88646-6. ●●●●● In light of the length of this book, readers who would like to have a more detailed description of the book's objectives and method may find it helpful to read the detailed and clearly written Wikipedia entry about this work: From the Wikipedia search page, use the search phrase "Critique of Impure Reason". At least at the time of this writing (11/29/2021), the Wikipedia entry is well-researched and accurate. ●●●●● In addition, a "Primer on Bartlett's CRITIQUE OF IMPURE REASON" has been made available by the author. It is available under its title through PhilPapers and other philosophy online archives. ●●●●● COMMENDATIONS OF THIS WORK, from the back cover of the published edition: ●●●●● “I admire its range of philosophical vision.” – Nicholas Rescher, Distinguished University Professor of Philosophy, University of Pittsburgh, author of more than 100 books. ●●●●● “Bartlett’s _Critique of Impure Reason_ is an impressive, bold, and ambitious work. Careful scholarship is balanced by original analyses that lead the reader to recognize the limits of meaning, knowledge, and conceptual possibility. The work addresses a host of traditional philosophical problems, among them the nature of space, time, causality, consciousness, the self, other minds, ontology, free will and determinism, and others. The book culminates in a fascinating and profound new understanding of relativity physics and quantum theory.” – Gerhard Preyer, Professor of Philosophy, Goethe-University, Frankfurt am Main, Germany, author of many books including _Concepts of Meaning_, _Beyond Semantics and Pragmatics_, _Intention and Practical Thought_, and _Contextualism in Philosophy_. ●●●●● “[This work’s] goal is of a unique and difficult species: Dr. Bartlett seeks to develop a formal logical calculus on the basis of transcendental philosophical arguments; in fact, he hopes that this calculus will be the formal expression of the transcendental foundation of knowledge.... I consider Dr. Bartlett’s work soundly conceived and executed with great skill.” – C. F. von Weizsäcker, philosopher and physicist, former Director, Max-Planck-Institute, Starnberg, Germany. ●●●●● “Bartlett has written an American “Prolegomena to All Future Metaphysics.” He aims rigorously to eliminate meaningless assertions, reach bedrock, and place philosophy on a firm foundation that will enable it, like science and mathematics, to produce lasting results that generations to come can build on. This is a great book, the fruit of a lifetime of research and reflection, and it deserves serious attention.” — Martin X. Moleski, former Professor, Canisius College, Buffalo, NY, studies of scientific method, the presuppositions of thought, and the self-referential nature of epistemology. ●●●●● “Bartlett has written a book on what might be called the underpinnings of philosophy. It has fascinating depth and breadth, and is all the more striking due to its unifying perspective based on the concepts of reference and self-reference.” – Don Perlis, Professor of Computer Science, University of Maryland, author of numerous publications on self-adjusting autonomous systems and philosophical issues concerning self-reference, mind, and consciousness. ●●●●● ●●●●● The _Critique of Impure Reason: Horizons of Possibility and Meaning_ comprises a major and important contribution to philosophy. Thanks to the generosity of its publisher, this massive 885-page volume has been published as a free open access eBook (3.75MB) as well as an open access printed edition. It inaugurates a revolutionary paradigm shift in philosophical thought by providing compelling and long-sought-for solutions to a wide range of philosophical problems. In the process, the work fundamentally transforms the way in which the concepts of reference, meaning, and possibility are understood. The book includes a Foreword by the celebrated German philosopher and physicist Carl Friedrich von Weizsäcker. ●●●●● In Kant’s _Critique of Pure Reason_ we find an analysis of the preconditions of experience and of knowledge. In contrast, but yet in parallel, the new _Critique_ focuses upon the ways—unfortunately very widespread and often unselfconsciously habitual—in which many of the concepts that we employ _conflict_ with the very preconditions of meaning and of knowledge. ●●●●● This is a book about the boundaries of frameworks and about the unrecognized conceptual confusions in which we become entangled when we attempt to transgress beyond the limits of the possible and meaningful. We tend either not to recognize or not to accept that we all-too-often attempt to trespass beyond the boundaries of the frameworks that make knowledge possible and the world meaningful. ●●●●● The _Critique of Impure Reason_ proposes a bold, ground-breaking, and startling thesis: that a great many of the major philosophical problems of the past can be solved through the recognition of a viciously deceptive form of thinking to which philosophers as well as non-philosophers commonly fall victim. For the first time, the book advances and justifies the criticism that a substantial number of the questions that have occupied philosophers fall into the category of “impure reason,” violating the very conditions of their possible meaningfulness. ●●●●● The purpose of the study is twofold: first, to enable us to recognize the boundaries of what is referentially forbidden—the limits beyond which reference becomes meaningless—and second, to avoid falling victims to a certain broad class of conceptual confusions that lie at the heart of many major philosophical problems. As a consequence, the boundaries of _possible meaning_ are determined. ●●●●● Bartlett, the author or editor of more than 20 books, is responsible for identifying this widespread and delusion-inducing variety of error, _metalogical projection_. It is a previously unrecognized and insidious form of erroneous thinking that undermines its own possibility of meaning. It comes about as a result of the pervasive human compulsion to seek to transcend the limits of possible reference and meaning. ●●●●● Based on original research and rigorous analysis combined with extensive scholarship, the _Critique of Impure Reason_ develops a self-validating method that makes it possible to recognize, correct, and eliminate this major and pervasive form of fallacious thinking. In so doing, the book provides at last provable and constructive solutions to a wide range of major philosophical problems. ●●●●● CONTENTS AT A GLANCE ▪▪▪▪▪ Preface ▪▪▪▪▪ Foreword by Carl Friedrich von Weizsäcker ▪▪▪▪▪ Acknowledgments ▪▪▪▪▪ Avant-propos: A philosopher’s rallying call ▪▪▪▪▪ Introduction ▪▪▪▪▪ A note to the reader ▪▪▪▪▪ A note on conventions ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART I ▪▪▪▪▪ ▪▪▪▪▪ WHY PHILOSOPHY HAS MADE NO PROGRESS AND HOW IT CAN ▪▪▪▪▪ 1 Philosophical-psychological prelude ▪▪▪▪▪ 2 Putting belief in its place: Its psychology and a needed polemic ▪▪▪▪▪ 3 Turning away from the linguistic turn: From theory of reference to metalogic of reference ▪▪▪▪▪ 4 The stepladder to maximum theoretical generality ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART II ▪▪▪▪▪ THE METALOGIC OF REFERENCE ▪▪▪▪▪ A New Approach to Deductive, Transcendental Philosophy ▪▪▪▪▪ 5 Reference, identity, and identification ▪▪▪▪▪ 6 Self-referential argument and the metalogic of reference ▪▪▪▪▪ 7 Possibility theory ▪▪▪▪▪ 8 Presupposition logic, reference, and identification ▪▪▪▪▪ 9 Transcendental argumentation and the metalogic of reference ▪▪▪▪▪ 10 Framework relativity ▪▪▪▪▪ 11 The metalogic of meaning ▪▪▪▪▪ 12 The problem of putative meaning and the logic of meaninglessness ▪▪▪▪▪ 13 Projection ▪▪▪▪▪ 14 Horizons ▪▪▪▪▪ 15 De-projection ▪▪▪▪▪ 16 Self-validation ▪▪▪▪▪ 17 Rationality: Rules of admissibility ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART III ▪▪▪▪▪ PHILOSOPHICAL APPLICATIONS OF THE METALOGIC OF REFERENCE ▪▪▪▪▪ Major Problems and Questions of Philosophy and the Philosophy of Science ▪▪▪▪▪ 18 Ontology and the metalogic of reference ▪▪▪▪▪ 19 Discovery or invention in general problem-solving, mathematics, and physics ▪▪▪▪▪ 20 The conceptually unreachable: “The far side” ▪▪▪▪▪ 21 The projections of the external world, things-in-themselves, other minds, realism, and idealism ▪▪▪▪▪ 22 The projections of time, space, and space-time ▪▪▪▪▪ 23 The projections of causality, determinism, and free will ▪▪▪▪▪ 24 Projections of the self and of solipsism ▪▪▪▪▪ 25 Non-relational, agentless reference and referential fields ▪▪▪▪▪ 26 Relativity physics as seen through the lens of the metalogic of reference ▪▪▪▪▪ 27 Quantum theory as seen through the lens of the metalogic of reference ▪▪▪▪▪ 28 Epistemological lessons learned from and applicable to relativity physics and quantum theory ▪▪▪▪▪ ▪▪▪▪▪ PART IV ▪▪▪▪▪ HORIZONS ▪▪▪▪▪ 29 Beyond belief ▪▪▪▪▪ 30 _Critique of Impure Reason_: Its results in retrospect ▪▪▪▪▪ ▪▪▪▪▪ SUPPLEMENT ▪▪▪▪▪ The Formal Structure of the Metalogic of Reference ▪▪▪▪▪ APPENDIX I ▪▪▪▪▪ The Concept of Horizon in the Work of Other Philosophers ▪▪▪▪▪ APPENDIX II ▪▪▪▪▪ Epistemological Intelligence ▪▪▪▪▪ References ▪▪▪▪▪ Index ▪▪▪▪▪ About the author. (shrink)

We present data and argument to show that in Tetris - a real-time interactive video game - certain cognitive and perceptual problems are more quickly, easily, and reliably solved by performing actions in the world rather than by performing computational actions in the head alone. We have found that some translations and rotations are best understood as using the world to improve cognition. These actions are not used to implement a plan, or to implement a reaction; they are used to (...) change the world in order to simplify the problem-solving task. Thus, we distinguish pragmatic actions ñ actions performed to bring one physically closer to a goal - from epistemic actions - actions performed to uncover information that is hidden or hard to compute mentally. To illustrate the need for epistemic actions, we first develop a standard information-processing model of Tetris-cognition, and show that it cannot explain performance data from human players of the game - even when we relax the assumption of fully sequential processing. Standard models disregard many actions taken by players because they appear unmotivated or superfluous. However, we describe many such actions that are actually taken by players that are far from superfluous, and that play valuable roles in improving human performance. We argue that traditional accounts are limited because they regard action as having a single function: to change the world. By recognizing a second function of action - an epistemic function - we can explain many of the actions that a traditional model cannot. Although, our argument is supported by numerous examples specifically from Tetris, we outline how the one category of epistemic action can be incorporated into theories of action more generally. (shrink)

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

Human biological memory systems have adapted to use technological artifacts to overcome some of the limitations of these systems. For example, when performing a difficult calculation, we use pen and paper to create and store external number symbols; when remembering our appointments, we use a calendar; when remembering what to buy, we use a shopping list. This chapter looks at the history of memory artifacts, describing the evolution from cave paintings to virtual reality. It first characterizes memory artifacts, memory systems, (...) and the two main functions such artifacts have, which are to aid individual users in completing memory tasks and as a cultural inheritance channel (section 2). It then outlines some of our first symbolic practices such as making cave paintings and figurines, and then moves on to outline several key developments in external representational systems and the artifacts that support these such as written language, numeral systems and counting devices, diagrams and maps, measuring devices, libraries and archives, photographs, analogue and digital computational artifacts, the World Wide Web, virtual reality, and smartphones (section 3). After that, it makes some brief points about the cumulative nature of the cultural evolution of memory artifacts and speculates about the possible future of memory artifacts, arguing that it is very difficult to look beyond an epistemological horizon of more than five years (section 4). (shrink)

This eighth book of the author on gambling math presents in accessible terms the cold mathematics behind the sparkling slot machines, either physical or virtual. It contains all the mathematical facts grounding the configuration, functionality, outcome, and profits of the slot games. Therefore, it is not a so-called how-to-win book, but a complete, rigorous mathematical guide for the slot player and also for game producers, being unique in this respect. As it is primarily addressed to the slot player, its goal (...) is to present practical applications of the mathematical models of slot games, in order to provide numerical results that a player can use as criteria for gaming decisions or just as information for any slot game and any predicted winning event. These results are focused on probability and expected value, these being the most important parameters for decisional criteria in slots. The book is packed with plenty of figures, tables, and formulas. The content is organized so that readers can skip the theoretical parts and go picking the practical results (numerical, in tables of values where possible, or ready-to-compute formulas) for the desired situation. The practical results are gathered in the last chapter, titled "Practical Applications and Numerical Results," the largest part of the book, for the most popular categories of slot machines, namely with 3, 5, 9, and 16 reels. Any other category of slot games is covered in the theoretical part of the book, where the general formulas apply not only to existing slot games, but also to possible future slot games of any design and configuration. The author does not just throw the slot mathematics to the audience and run away, but offers an ultimate practical contribution with the chapter "How to estimate the number of stops and the symbol distribution on a reel", a surprise for both players and producers, where one can see that mathematics provides players with some statistical methods as well as methods based on physical measurements for retrieving these missing data. Having these data along with the mathematical results of this book, anyone can generate the PAR sheet of any slot machine. In the last decade, mathematics has been taken more and more seriously into account in gaming, as being the essence that governs the games of chance and the only rigorous tool providing information on optimal play, where possible. For the popular game of slots, mathematics already fulfilled its duty by providing all the data that it can provide and that cannot be found on the display of the slot machines - it is all here in this book. (shrink)

Operations research science is defined as the science that is concerned with applying scientific methods to complex problems in managing and directing large systems of people, including resources and tools in various fields, private and governmental work, peace and war, politics, administration, economics, planning and implementation in various domains. It uses scientific methods that take the language of mathematics as a basis for it and uses computer, without which it would not have been possible to achieve numerical solutions to (...) the raised problems, those that need correct solutions, when the solutions abound and the options are multiple, so we need a decision based on correct scientific foundations and takes into account all the circumstances and changes that you can encounter the decision-maker during the course of work, and nothing is left to chance or luck, but rather everything that enters into the account and plays its role in decision-making, and we get that when we use the concepts of neutrosophic science to reformulate what the science of operations research presented in terms of methods and methods to solve many practical problems, so we will present in this research a study aimed at shedding light on the most important methods used to solve nonlinear models, which is the Lagrangian multiplier method for nonlinear models constrained by equality and then reformulated using the concepts of neutrosophic science. (shrink)

Problems and questions originally raised by Robert Nozick in his famous thought experiment ‘The Experience Machine’ are frequently invoked in the current discourse concerning virtual worlds. Having conceptualized his Gedankenexperiment in the early seventies, Nozick could not fully anticipate the numerous and profound ways in which the diffusion of computer simulations and video games came to affect the Western world. -/- This article does not articulate whether or not the virtual worlds of video games, digital simulations, and virtual technologies currently (...) actualize (or will actualize) Nozick’s thought experiment. Instead, it proposes a philosophical reflection that focuses on human experiences in the upcoming age of their ‘technical reproducibility’. -/- In pursuing that objective, this article integrates and supplements some of the interrogatives proposed in Robert Nozick’s thought experiment. More specifically, through the lenses of existentialism and philosophy of technology, this article tackles the technical and cultural heritage of virtual reality, and unpacks its potential to function as a tool for self-discovery and self-construction. Ultimately, it provides an interpretation of virtual technologies as novel existential domains. Virtual worlds will not be understood as the contexts where human beings can find completion and satisfaction, but rather as instruments that enable us to embrace ourselves and negotiate with various aspects of our (individual as well as collective) existence in previously-unexperienced guises. (shrink)

Chapter 3 of the ongoing publication "Artificial Aesthetics" Book information: Assume you're a designer, an architect, a photographer, a videographer, a curator, an art historian, a musician, a writer, an artist, or any other creative professional or student. Perhaps you're a digital content creator who works across multiple platforms. Alternatively, you could be an art historian, curator, or museum professional. -/- You may be wondering how AI will affect your professional area in general and your work and career. Our book (...) offers intellectual tools to help us better see the future of creative fields. These tools come from philosophy of art, experimental psychology, media theory, digital culture studies and data science. The book is the first to combine these different perspectives together. -/- We started the work on the book in summer 2019, exchanging numerous messages, commenting on each other ideas, and sharing drafts of sections. The final book is a result of this process. Although each chapter is written by one author, it reflects the discussions we had over 27 months. (shrink)

Chapter 1 of the ongoing online publication "Artificial Aesthetics: A Critical Guide to AI, Media and Design", Lev Manovich and Emanuele Arielli -/- Book information: Assume you're a designer, an architect, a photographer, a videographer, a curator, an art historian, a musician, a writer, an artist, or any other creative professional or student. Perhaps you're a digital content creator who works across multiple platforms. Alternatively, you could be an art historian, curator, or museum professional. -/- You may be wondering how (...) AI will affect your professional area in general and your work and career. Our book offers intellectual tools to help us better see the future of creative fields. These tools come from philosophy of art, experimental psychology, media theory, digital culture studies and data science. The book is the first to combine these different perspectives together. -/- We started the work on the book in summer 2019, exchanging numerous messages, commenting on each other ideas, and sharing drafts of sections. The final book is a result of this process. Although each chapter is written by one author, it reflects the discussions we had over 27 months. (shrink)