Research profile
8 papers in 3 journals, 2016–2022. Every paper is single-author. Corresponding author on 8.
8 publications
-
Published Subscription
Hyperspaces and Superspaces: Linearity and BoundednessBy Mark Burgin
Abstract: Continuing the previous research, we analyze constructions of hyperspaces and superspaces elaborating classifications of such spaces. The main emphasis is on linear hyperspaces, which are formed over linear spaces with additional structures such as norms and seminorms. Linear hyperspaces are constructed over multiseminormed linear spaces and their properties are studied. In particular, it is demonstrated that a linear hyperspace over a multiseminormed linear space is a multihyperseminormed linear space. This …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 2, 2022 · pp. 11–27 Read article →
-
Published Subscription
Projectivity of Universal AlgebrasBy Mark Burgin
Abstract: The basic relations between universal algebras are homomorphisms and their special cases – monomorphisms, epimorphisms, and isomorphisms (cf., for example, (Kurosh, 1963; Cohn, 1965)). In this paper, we introduce and study a novel relation between universal algebras, which is called projectivity and allows obtaining properties of universal algebras from properties of those universal algebras to which they are weakly or finally projective. The key property of projectivity relations is that …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 1, 2022 · pp. 6–20 Read article →
-
Published Subscription
Inductive Turing Machines of Higher Orders: Computability, Acceptability and DecidabilityBy Mark Burgin
Abstract: In this paper, the basic forms of information processing by inductive Turing machines of the order n are explored where n 1. It is demonstrated that different types of acceptability, recognizability, and computability of sets and formal languages by inductive Turing machines of the order n are equivalent. This allows high flexibility in modeling functioning of computers and computer networks by choosing the better suited forms of information processing. …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 8, Issue 2, 2021 · pp. 10–26 Read article →
-
Published Subscription
Inductively Computable Sets and FunctionsBy Mark Burgin
Abstract: AbstractInductive computations are used in many areas of computer and network technology. Inductive reasoning forms the base for scientific exploration. A mathematical model of inductive computations and reasoning is called an inductive Turing machine, which is a natural extension of the most popular model of computing devices and computations - Turing machine. In comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science …
Published in Journal of Computer Technology & Applications · Vol. 7, Issue 1, 2016 · pp. 12–21 Read article →
-
Published Subscription
Grammars with ExclusionBy Mark Burgin
Abstract: AbstractFormal grammars represent a practical tool for description and processing programming languages, as well as for modeling and study of natural languages. In this paper, we introduce and study a new type of formal grammars—grammars with exclusion. Procedures of language generation by grammars with exclusion are elaborated. In contrast to conventional formal grammars, one grammar with exclusion can generate several types of languages. It isdemonstrated that they have essentially higher …
Published in Journal of Computer Technology & Applications · Vol. 6, Issue 2, 2015 · pp. 56–66 Read article →
-
Published Subscription
Periodic Turing MachinesBy Mark Burgin
Abstract: AbstractIt is proved that in comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science providing better models for contemporary computers and computer networks. In particular, it is proved that simple inductive Turing machines can solve the Halting Problem for Turing machines, while inductive Turing machines of higher orders can generate and decide the whole arithmetical hierarchy. It means that inductive Turing machines …
Published in Journal of Computer Technology & Applications · Vol. 5, Issue 3, 2014 · pp. 6–18 Read article →
-
Published Subscription
Actors, Agents and Oracles in the Context of Artificial IntelligenceBy Mark Burgin
Abstract: AbstractIn this paper, we further develop the action theory of stratified hierarchic intelligence oriented at the creation of artificial intelligence. In this framework, we analyze and study the concept of an actor extending this concept and the corresponding model from specifically computational context to systems theory. The goal is to explore and use actor model for intelligent systems. The next step in the development of the action theory of hierarchic …
Published in Journal of Artificial Intelligence Research & Advances · Vol. 4, Issue 3, 2017 · pp. 17–25 Read article →
-
Published Subscription
On the Power of Oracles in the Context of Hierarchical IntelligenceBy Mark Burgin
Abstract: Artificial intelligence (AI) is aimed at the construction of artificial systems with intelligent behavior. At first, AI researchers tried to elaborate a uniform technological (computational) system that had intelligence. However, psychological and neurophysiological studies demonstrated heterogeneous hierarchical organization of the human psyche and intelligence. That is why the contemporary approach to AI is based on heterogeneous hierarchical architecture of computational systems. In this paper, we study the intelligence hierarchy formalized …
Published in Journal of Artificial Intelligence Research & Advances · Vol. 3, Issue 2, 2016 · pp. 6–17 Read article →