Mark Burgin

Mr. Mark Burgin

Department of Mathematics, University of California, Box 951555, Los Angeles, CA 90095, USA

Research Focus & Metrics

Academic Career Length

57Years (1970-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 June 2003 in Entropy
Verified
Journal Article
Open access
PDF file
Mark BurginMark Burgin
Mark Burgin
A contradictory and paradoxical situation that currently exists in information studies can be improved by the introduction of a new information approach, which is called the general theory of information. The main achievement of the general theory of information is explication of a relevant and adequate definition of information. This theory is built as a system of two classes of principles (ontological and sociological) and their consequences. Axiological principles, which explain how to measure and evaluate information and information processes, are presented in the second section of this paper. These principles systematize and unify different approaches, existing as well as possible, to construction and utilization of information measures. Examples of such measures are given by Shannon’s quantity of information, algorithmic quantity of information or volume of information. It is demonstrated that all other known directions of information theory may be treated inside general theory of information as its particular cases.

Verified
Journal Article
Open access
PDF file
Mark BurginMark Burgin
Mark Burgin
Rao MikkilineniRao Mikkilineni
Rao Mikkilineni
Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as opposed to data), because knowledge is an abstract structure. There are different forms of knowledge representations derived from data. One of the basic forms is called a schema, which can belong to one of three classes: operational, descriptive, and representation schemas. The goal of this paper is the development of theoretical and practical tools for processing operational schemas. To achieve this goal, we use schema representations elaborated in the mathematical theory of schemas and use structural machines as a powerful theoretical tool for modeling parallel and concurrent computational processes. We describe the schema of autopoietic machines as physical realizations of structural machines. An autopoietic machine is a technical system capable of regenerating, reproducing, and maintaining itself by production, transformation, and destruction of its components and the networks of processes downstream contained in them. We present the theory and practice of designing and implementing autopoietic machines as information processing structures integrating both symbolic computing and neural networks. Autopoietic machines use knowledge structures containing the behavioral evolution of the system and its interactions with the environment to maintain stability by counteracting fluctuations.

27 March 2024 in Philosophies
Verified
Journal Article
Open access
PDF file
Gordana M. Dodig-CrnkovicGordana M. Dodig-Crnkovic
Gordana M. Dodig-Crnkovic
Mark BurginMark Burgin
Mark Burgin
Agents and agent-based systems are becoming essential in the development of various fields, such as artificial intelligence, ubiquitous computing, ambient intelligence, autonomous computing, and intelligent robotics. The concept of autonomous agents, inspired by the observed agency in living systems, is also central to current theories on the origin, development, and evolution of life. Therefore, it is crucial to develop an accurate understanding of agents and the concept of agency. This paper begins by discussing the role of agency in natural systems as an inspiration and motivation for agential technologies and then introduces the idea of artificial agents. A systematic approach is presented for the classification of artificial agents. This classification aids in understanding the existing state of the artificial agents and projects their potential future roles in addressing specific types of problems with dedicated agent types.

15 November 2022 in Information
Verified
Journal Article
Open access
PDF file
Mark BurginMark Burgin
Mark Burgin
Rao MikkilineniRao Mikkilineni
Rao Mikkilineni
Some researchers suggest that information is a form of matter, calling it the fifth state of matter or the fifth element. Recent results from the general theory of information (GTI) contradict this. This paper aims to explain and prove that the claims of adherents of the physical nature of information are inaccurate due to the confusion between the definitions of information, the matter that represents information, and the matter that is a carrier of information. Our explanations and proofs are based on the GTI because it gives the most comprehensive definition of information, encompassing and clarifying many of the writings in the literature about information. GTI relates information, knowledge, matter, and energy, and unifies the theories of material and mental worlds using the world of structures. According to GTI, information is not physical by itself, although it can have physical and/or mental representations. Consequently, a bit of information does not have mass, but the physical structure that represents the bit indeed has mass. Moreover, the same bit can have multiple representations in the form of a physical substance (e.g., a symbol on a paper or a state of a flip-flop circuit, or an electrical voltage or current pulse.) Naturally, these different physical representations can have different masses, although the information is the same. Thus, our arguments are not against Landauer’s principle or the empirical results of Vopson and other adherents of the physical nature of the information. These arguments are aimed at the clarification of the theoretical and empirical interpretations of these results. As the references in this paper show, recently many publications in which it is claimed that information is a physical essence appeared. That is why it is so important to elucidate the true nature of information and its relation to the physical world eliminating the existing misconceptions in information studies.

1 December 2003 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Mark BurginMark Burgin
Mark Burgin
Nonlinear phenomena, which are so important in nature and society, are considered here in relation to the world of algorithms and computations. To have a mathematical model for this world, formal computability spaces are introduced. It is demonstrated that the traditional approach to algorithms, which is based on such popular models as Turing machines, results in linear subspaces of the computability space. Nonlinear phenomena appear when we go to the more powerful class of such super-recursive algorithms as inductive Turing machines. It is demonstrated how this nonlinearity imports much higher computing power of inductive Turing machines in comparison with conventional Turing machines. This provides a base to consider problems of chaos, emergent computations and infinity from the algorithmic point of view.

13 February 2020 in Information
Verified
Journal Article
Open access
PDF file
Mark BurginMark Burgin
Mark Burgin
Algorithms and abstract automata (abstract machines) are used to describe, model, explore and improve computers, cell phones, computer networks, such as the Internet, and processes in them. Traditional models of information processing systems—abstract automata—are aimed at performing transformations of data. These transformations are performed by their hardware (abstract devices) and controlled by their software (programs)—both of which stay unchanged during the whole computational process. However, in physical computers, their software is also changing by special tools such as interpreters, compilers, optimizers and translators. In addition, people change the hardware of their computers by extending the external memory. Moreover, the hardware of computer networks is incessantly altering—new computers and other devices are added while other computers and other devices are disconnected. To better represent these peculiarities of computers and computer networks, we introduce and study a more complete model of computations, which is called a triadic automaton or machine. In contrast to traditional models of computations, triadic automata (machine) perform computational processes transforming not only data but also hardware and programs, which control data transformation. In addition, we further develop taxonomy of classes of automata and machines as well as of individual automata and machines according to information they produce.