arXiv subjects

Mark Burgin

Publications and source records attributed to Mark Burgin.

At least 19 recordsLinked to original sources

arXiv2021

Non-Diophantine arithmetic as the mathematical foundation for quantum field theory

The problem of infinities in quantum field theory (QRT) is a long standing problem in physics.For solving this problem, different renormalization techniques have been suggested but the problem still persists. Here we suggest another approachto the elimination of infinities in QFT, which is based on non-Diophantine arithmetics - a novel mathematical area that already found useful applications in physics. To achieve this goal, new non-Diophantine arithmetics are constructed and their properties are studied. This allows using these arithmetics for computing integrals describing Feynman diagrams. Although in the conventional QFT these integrals diverge, their non-Diophantine counterparts are convergent and rigorously defined.

physics.gen-ph↗

arXiv2017

Systems, Actors and Agents: Operation in a multicomponent environment

Multi-agent approach has become popular in computer science and technology. However, the conventional models of multi-agent and multicomponent systems implicitly or explicitly assume existence of absolute time or even do not include time in the set of defining parameters. At the same time, it is proved theoretically and validated experimentally that there are different times and time scales in a variety of real systems - physical, chemical, biological, social, informational, etc. Thus, the goal of this work is construction of a multi-agent multicomponent system models with concurrency of processes and diversity of actions. To achieve this goal, a mathematical system actor model is elaborated and its properties are studied.

cs.MA↗

arXiv2017

Mathematical Knowledge and the Role of an Observer: Ontological and epistemological aspects

As David Berlinski writes (1997), the existence and nature of mathematics is a more compelling and far deeper problem than any of the problems raised by mathematics itself. Here we analyze the essence of mathematics making the main emphasis on mathematics as an advanced system of knowledge. This knowledge consists of structures and represents structures, existence of which depends on observers in a nonstandard way. Structural nature of mathematics explains its reasonable effectiveness.

math.HO↗

arXiv2017

Scaling Qualitative Probability

There are different approaches to qualitative probability, which includes subjective probability. We developed a representation of qualitative probability based on relational systems, which allows modeling uncertainty by probability structures and is more coherent than existing approaches. This setting makes it possible proving that any comparative probability is induced by some probability structure (Theorem 2.1), that classical probability is a probability structure (Theorem 2.2) and that inflated, i.e., larger than 1, probability is also a probability structure (Theorem 2.3). In addition, we study representation of probability structures by classical probability.

math.PR↗

arXiv2013

Typologies of Computation and Computational Models

We need much better understanding of information processing and computation as its primary form. Future progress of new computational devices capable of dealing with problems of big data, internet of things, semantic web, cognitive robotics and neuroinformatics depends on the adequate models of computation. In this article we first present the current state of the art through systematization of existing models and mechanisms, and outline basic structural framework of computation. We argue that defining computation as information processing, and given that there is no information without (physical) representation, the dynamics of information on the fundamental level is physical/ intrinsic/ natural computation. As a special case, intrinsic computation is used for designed computation in computing machinery. Intrinsic natural computation occurs on variety of levels of physical processes, containing the levels of computation of living organisms (including highly intelligent animals) as well as designed computational devices. The present article offers a typology of current models of computation and indicates future paths for the advancement of the field; both by the development of new computational models and by learning from nature how to better compute using different mechanisms of intrinsic computation.

cs.GL↗

arXiv2013

Negative probability in the framework of combined probability

Negative probability has found diverse applications in theoretical physics. Thus, construction of sound and rigorous mathematical foundations for negative probability is important for physics. There are different axiomatizations of conventional probability. So, it is natural that negative probability also has different axiomatic frameworks. In the previous publications (Burgin, 2009; 2010), negative probability was mathematically formalized and rigorously interpreted in the context of extended probability. In this work, the axiomatic system that synthesizes conventional probability and negative probability is constructed in the form of combined probability. In a mathematically rigorous way, both theoretical concepts - combined probability and extended probability - stretch conventional probability so that it can takes negative values. After introducing axioms for combined probability, we study its properties, as well as relations to extended probability and conventional probability.

math.PR↗

arXiv2013

Evolutionary Turing in the Context of Evolutionary Machines

One of the roots of evolutionary computation was the idea of Turing about unorganized machines. The goal of this work is the development of foundations for evolutionary computations, connecting Turing's ideas and the contemporary state of art in evolutionary computations. To achieve this goal, we develop a general approach to evolutionary processes in the computational context, building mathematical models of computational systems, functioning of which is based on evolutionary processes, and studying properties of such systems. Operations with evolutionary machines are described and it is explored when definite classes of evolutionary machines are closed with respect to basic operations with these machines. We also study such properties as linguistic and functional equivalence of evolutionary machines and their classes, as well as computational power of evolutionary machines and their classes, comparing of evolutionary machines to conventional automata, such as finite automata or Turing machines.

cs.AI↗

arXiv2013

Basic Classes of Grammars with Prohibition

A practical tool for natural language modeling and development of human-machine interaction is developed in the context of formal grammars and languages. A new type of formal grammars, called grammars with prohibition, is introduced. Grammars with prohibition provide more powerful tools for natural language generation and better describe processes of language learning than the conventional formal grammars. Here we study relations between languages generated by different grammars with prohibition based on conventional types of formal grammars such as context-free or context sensitive grammars. Besides, we compare languages generated by different grammars with prohibition and languages generated by conventional formal grammars. In particular, it is demonstrated that they have essentially higher computational power and expressive possibilities in comparison with the conventional formal grammars. Thus, while conventional formal grammars are recursive and subrecursive algorithms, many classes of grammars with prohibition are superrecursive algorithms. Results presented in this work are aimed at the development of human-machine interaction, modeling natural languages, empowerment of programming languages, computer simulation, better software systems, and theory of recursion.

cs.FL↗

arXiv2012

From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations

In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation. At first, we describe how the classical algorithmic universe developed and analyze why it became closed in the conventional approach to computation. Then we explain how new models of algorithms turned the classical closed algorithmic universe into the open world of algorithmic constellations, allowing higher flexibility and expressive power, supporting constructivism and creativity in mathematical modeling. As Goedels undecidability theorems demonstrate, the closed algorithmic universe restricts essential forms of mathematical cognition. In contrast, the open algorithmic universe, and even more the open world of algorithmic constellations, remove such restrictions and enable new, richer understanding of computation.

cs.OH↗

arXiv2012

Axiomatic Tools versus Constructive approach to Unconventional Algorithms

In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the greater power of new types of algorithms also brought the greater complexity of the algorithmic universe, demanding new tools for its study. That is why we analyze new powerful tools brought forth by the axiomatic theory of algorithms, automata and computation.

cs.GL↗

arXiv2011

Differentiation in Bundles with a Hyperspace Base

It is possible to perform some operations with extrafunctions applying these operations separately to each coordinate. Operations performed in this manner are called regular. It is proved that it is possible to extend several operations with functions to regular operations with extrafunctions. Examples of such operations are addition of real functions and multiplication of real functions by numbers. However, there are operations with functions the extension of which by coordinates does not work because their application is not invariant with respect to representations of extrafunctions. One of such operations is differentiation, which is important for calculus, differential equations and many applications. In this work, a method of regularization of irregular operations is developed and applied to differentiation. The main constructions are put together in the context of fiber bundles over hyperspaces of differential vector spaces and differential algebras.

math.CA↗

arXiv2011

Logical Varieties in Normative Reasoning

Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for any logical calculus is its consistency. At the same time, knowledge about large object domains (in science or in practice) is essentially inconsistent. Logical prevarieties and varieties were introduced to eliminate these limitations in a logically correct way. In this paper, the Logic of Reasonable Inferences is described. This logic has been applied successfully to model legal reasoning with inconsistent knowledge. It is demonstrated that this logic is a logical variety and properties of logical varieties related to legal reasoning are developed.

cs.LO↗

arXiv2010

Introduction to Projective Arithmetics

Science and mathematics help people to better understand world, eliminating many inconsistencies, fallacies and misconceptions. One of such misconceptions is related to arithmetic of natural numbers, which is extremely important both for science and everyday life. People think their counting is governed by the rules of the conventional arithmetic and thus other kinds of arithmetics of natural numbers do not exist and cannot exist. However, this popular image of the situation with the natural numbers is wrong. In many situations, people have to utilize and do implicitly utilize rules of counting and operating different from rules and operations in the conventional arithmetic. This is a consequence of the existing diversity in nature and society. To correctly represent this diversity, people have to explicitly employ different arithmetics. To make a distinction, we call the conventional arithmetic by the name Diophantine arithmetic, while other arithmetics are called non-Diophantine. There are two big families of non-Diophantine arithmetics: projective arithmetics and dual arithmetics (Burgin, 1997). In this work, we give an exposition of projective arithmetics, presenting their properties and considering also a more general mathematical structure called a projective prearithmetic. The Diophantine arithmetic is a member of this parametric family: its parameter is equal to the identity function f(x) = x. In conclusion, it is demonstrated how non-Diophantine arithmetics may be utilized beyond mathematics and how they allow one to eliminate inconsistencies and contradictions encountered by other researchers.

math.GM↗

arXiv2010

Interpretations of Negative Probabilities

In this paper, we give a frequency interpretation of negative probability, as well as of extended probability, demonstrating that to a great extent, these new types of probabilities, behave as conventional probabilities. Extended probability comprises both conventional probability and negative probability. The frequency interpretation of negative probabilities gives supportive evidence to the axiomatic system built in (Burgin, 2009; arXiv:0912.4767) for extended probability as it is demonstrated in this paper that frequency probabilities satisfy all axioms of extended probability.

physics.data-an↗

arXiv2010

Continuity in Discrete Sets

Continuous models used in physics and other areas of mathematics applications become discrete when they are computerized, e.g., utilized for computations. Besides, computers are controlling processes in discrete spaces, such as films and television programs. At the same time, continuous models that are in the background of discrete representations use mathematical technology developed for continuous media. The most important example of such a technology is calculus, which is so useful in physics and other sciences. The main goal of this paper is to synthesize continuous features and powerful technology of the classical calculus with the discrete approach of numerical mathematics and computational physics. To do this, we further develop the theory of fuzzy continuous functions and apply this theory to functions defined on discrete sets. The main interest is the classical Intermediate Value theorem. Although the result of this theorem is completely based on continuity, utilization of a relaxed version of continuity called fuzzy continuity, allows us to prove discrete versions of the Intermediate Value theorem. This result provides foundations for a new approach to discrete dynamics.

math.CA↗

arXiv2009

Extended Probabilities: Mathematical Foundations

There are important problems in physics related to the concept of probability. One of these problems is related to negative probabilities used in physics from 1930s. In spite of many demonstrations of usefulness of negative probabilities, physicists looked at them with suspicion trying to avoid this new concept in their theories. The main question that has bothered physicists is mathematical grounding and interpretation of negative probabilities. In this paper, we introduce extended probability as a probability function, which can take both positive and negative values. Defining extended probabilities in an axiomatic way, we show that classical probability is a positive section of extended probability.

math-ph↗

arXiv2009

A Systematic Approach to Artificial Agents

Agents and agent systems are becoming more and more important in the development of a variety of fields such as ubiquitous computing, ambient intelligence, autonomous computing, intelligent systems and intelligent robotics. The need for improvement of our basic knowledge on agents is very essential. We take a systematic approach and present extended classification of artificial agents which can be useful for understanding of what artificial agents are and what they can be in the future. The aim of this classification is to give us insights in what kind of agents can be created and what type of problems demand a specific kind of agents for their solution.

cs.AI↗

arXiv2008

Foundations of Information Theory

Information is the basic concept of information theory. However, there is no definition of this concept that can encompass all uses of the term information in information theories and beyond. Many question a possibility of such a definition. However, foundations of information theory developed in the context of the general theory of information made it possible to build such a relevant and at the same time, encompassing definition. Foundations of information theory are built in a form of ontological principles, which reflect basic features of information and information processes.

cs.IT↗