The glossariumBITri, planned as a central activity for the interdisciplinary study of information, developed by BITrum group in cooperation with the University of Santa Elena (Ecuador), essentially aims at serving as a tool for the... more
The glossariumBITri, planned as a central activity for the interdisciplinary study of information, developed by BITrum group in cooperation with the University of Santa Elena (Ecuador), essentially aims at serving as a tool for the clarification of concepts, theories and problems concerning information. Intending to embrace the most relevant points of view with respect to information, it is interdisciplinarily developed by a board of experts coming from a wide variety of scientific fields. The glossariumBITri kindly invites the scientific community to make contributions of any kind aimed at clarifying in the field of information studies.
Research Interests:
To apply technology to problems of age and aging, we need to better understand these problems and to develop operational technique for their solving. Creation of foundations for such a technique by means of a multifaceted model of age is... more
To apply technology to problems of age and aging, we need to better understand these problems and to develop operational technique for their solving. Creation of foundations for such a technique by means of a multifaceted model of age is the main goal of this paper. The suggested approach is based on the system theory of time, multilayer model of
Research Interests:
To apply technology to problems of age and aging, we need to better understand these problems and to develop operational technique for their solving. Creation of foundations for such a technique by means of a multifaceted model of age is... more
To apply technology to problems of age and aging, we need to better understand these problems and to develop operational technique for their solving. Creation of foundations for such a technique by means of a multifaceted model of age is the main goal of this paper. The suggested approach is based on the system theory of time, multilayer model of
Research Interests:
Summary A new and detailed methodological model of scientific knowledge is constructed and studied. This model unites and develops other approaches in the modern methodology of science such as standard conception (R.Carnap, A.Tarski,... more
Summary A new and detailed methodological model of scientific knowledge is constructed and studied. This model unites and develops other approaches in the modern methodology of science such as standard conception (R.Carnap, A.Tarski, C.Hempel), structuralist program (J.D.Sneed, W.Balzer, C.U.Mouines), instrumentalist view (P.W.Bridgman), etc. Тhе suggested model of scientific values is built on the basis of structure-nominative approach that includes informal heuristic ideas and precise mathematical tools from the new field of mathematics – the theory of named sets. One of the principal systems of scientific knowledge is the axiological system. Its study is the main goal of the book. The basic concepts of the axiological system are the estimation and value. Their informal analysis is supplemented by their precise modeling by theory of abstract properties. It opens the way to investigate not only such values as truth and consistency, but also such estimations as theoreticity, fundamentality, heuristicity, validity, importance, beauty, practicality and so on. The authors present different new results of scientific axiology. It gives a new and promising insight in many important problems of general axiology. СONTENTS Introduction 3 Chapter 1. Mathematical tools of modern methodology of science 1.1. Fundamentals of set theory and category theory 13 1.2. Basic constructions of named set theory 16 1.3. Some concepts of the theory of relations 18 1.4. Elements of the general theory of properties 19 Chapter2. The structure-nominative approach in methodology of science 2.1. Methodological models of scientific knowledge 46 systems 2.2. The structure-nominative reconstruction of scientific 52 theory 2.3. Levels and subsystems of scientific theory 58 2.4. The structure-nominative classification of knowledge 76 2.5. Scientific theory and creativity 83 Chapter3. Axiological structures in scientific knowledge 3.1. The concept of estimation 87 3.2. Estimations and their models 99 3.3. Values and their types 112 Chapter 4. Theoretical systems and their estimations 4.1. Theoreticity 123 4.2. Fundamentally 137 4.3. Heuristicity and validity 159 4.4. Significance and beauty 165 Conclusion 172 Bibliography 173 Subject index 179 Summary 181
Research Interests:
Summary A new and detailed methodological model of scientific knowledge is constructed and studied. This model unites and develops other approaches in the modern methodology of science such as standard conception (R.Carnap, A.Tarski,... more
Summary A new and detailed methodological model of scientific knowledge is constructed and studied. This model unites and develops other approaches in the modern methodology of science such as standard conception (R.Carnap, A.Tarski, C.Hempel), structuralist program (J.D.Sneed, W.Balzer, C.U.Mouines), instrumentalist view (P.W.Bridgman), etc. Тhе suggested model of scientific values is built on the basis of structure-nominative approach that includes informal heuristic ideas and precise mathematical tools from the new field of mathematics – the theory of named sets. One of the principal systems of scientific knowledge is the axiological system. Its study is the main goal of the book. The basic concepts of the axiological system are the estimation and value. Their informal analysis is supplemented by their precise modeling by theory of abstract properties. It opens the way to investigate not only such values as truth and consistency, but also such estimations as theoreticity, fundamentality, heuristicity, validity, importance, beauty, practicality and so on. The authors present different new results of scientific axiology. It gives a new and promising insight in many important problems of general axiology. СONTENTS Introduction 3 Chapter 1. Mathematical tools of modern methodology of science 1.1. Fundamentals of set theory and category theory 13 1.2. Basic constructions of named set theory 16 1.3. Some concepts of the theory of relations 18 1.4. Elements of the general theory of properties 19 Chapter2. The structure-nominative approach in methodology of science 2.1. Methodological models of scientific knowledge 46 systems 2.2. The structure-nominative reconstruction of scientific 52 theory 2.3. Levels and subsystems of scientific theory 58 2.4. The structure-nominative classification of knowledge 76 2.5. Scientific theory and creativity 83 Chapter3. Axiological structures in scientific knowledge 3.1. The concept of estimation 87 3.2. Estimations and their models 99 3.3. Values and their types 112 Chapter 4. Theoretical systems and their estimations 4.1. Theoreticity 123 4.2. Fundamentally 137 4.3. Heuristicity and validity 159 4.4. Significance and beauty 165 Conclusion 172 Bibliography 173 Subject index 179 Summary 181
Research Interests:
... Narayan Debnath Computer Science Department Winona State Universig Winona, MN55987, USA Wenying Feng Computer SciencdStudies program Trent University Peterborough, ON Canada Mark Burgin Joshua Wilson and Joseph Cropper ...
Research Interests:
... Narayan Debnath Computer Science Department Winona State Universig Winona, MN55987, USA Wenying Feng Computer SciencdStudies program Trent University Peterborough, ON Canada Mark Burgin Joshua Wilson and Joseph Cropper ...
Research Interests:
Research Interests:
The main goal of the present paper is to extend such classical constructions as limits and derivatives making them appropriate for management of imprecise, vague, uncertain, and incomplete information. In the second part of the paper,... more
The main goal of the present paper is to extend such classical constructions as limits and derivatives making them appropriate for management of imprecise, vague, uncertain, and incomplete information. In the second part of the paper, going after introduction, elements of the theory of fuzzy limits are presented. The third part is devoted to the construction of fuzzy derivatives of real functions. Two kinds of fuzzy derivatives are introduced: weak and strong ones. It is necessary to remark that the strong fuzzy derivatives are similar to ordinary derivatives of real functions being their fuzzy extensions. The weak fuzzy derivatives generate a new concept of a weak derivative even in a classical case of exact limits. In the fourth part fuzzy differentiable functions are studied. Different properties of such functions are obtained. Some of them are the same or at least similar to the properties of the differentiable functions while other properties differ in many aspects from those o...
Research Interests:
We study software testing as a distributed component of the software life cycle, developing a technique for estimating testing validity. The goal of this paper is to build measures for testing result estimation, to find how tested... more
We study software testing as a distributed component of the software life cycle, developing a technique for estimating testing validity. The goal of this paper is to build measures for testing result estimation, to find how tested properties influence software quality, and to develop means (methodology and algorithms) to achieve better results in testing. To achieve these goals, we suggest using system approach to testing developed in this paper and introduce a system of test efficiency measures, as well as discuss a methodology of how to use these measures. Properties of test efficiency measures oriented at the software engineering domain are studied. We also show (Proposition 1, Theorem 1 and their Corollaries) how logic can increase testing efficiency.
Research Interests:
Research Interests: Computer Science, Software Engineering, Project Management, Fuzzy set theory, Scheduling, and 14 moreFuzzy Sets, Fuzzy Systems, Software Measurement, Software Design, Software Quality, Uncertainty, Software Metrics, Design process, Process Design, Problem, Program Design, Fuzzy Set, Categorical Data, and software metric
Research Interests:
... Mark Burgin (University of California, Los Angele, USA) International Advisory Board: Søren Brier (Copenhagen Business School, Copenhagen, Denmark) Tony Bryant (Leeds Metropolitan University, Leeds, United Kingdom) Gordana... more
... Mark Burgin (University of California, Los Angele, USA) International Advisory Board: Søren Brier (Copenhagen Business School, Copenhagen, Denmark) Tony Bryant (Leeds Metropolitan University, Leeds, United Kingdom) Gordana Dodig-Crnkovic (Mälardalen University ...
Research Interests:
Abstract. There are different aspects and spheres of natural and unconventional computations. In this paper, we analyze methodological and philosophical implications of algorithmic issues of unconventional computations. At first, we... more
Abstract. There are different aspects and spheres of natural and unconventional computations. In this paper, we analyze methodological and philosophical implications of algorithmic issues of unconventional computations. At first, we describe how the classical algorithmic universe has been developed and analyze why it became closed in the conventional approach to computation in particular and information processing in general. Then we explain how the new models of algorithms constructed by different authors ...
Research Interests:
Research Interests:
Research Interests: Philosophy and Synthese
Research Interests: Statistics and Fuzzy Sets
Research Interests:
The goal of this paper is to study the process of evolution of evolution. In other words, we study evolution that adapts evolutionary algorithms in parallel with their solutions. For this purpose, we define and investigate several... more
The goal of this paper is to study the process of evolution of evolution. In other words, we study evolution that adapts evolutionary algorithms in parallel with their solutions. For this purpose, we define and investigate several extensions of evolutionary Turing machine model: self-constructing evolutionary Turing machines (SETM), self-constructing evolutionary Turing machines with a basic constructor (SBETM), self-constructing evolutionary Turing
Research Interests:
ABSTRACT In this paper we study expressiveness of evolutionary computation. To do so we introduce evolutionary automata and define their several subclasses. To our surprise, we got the result that evolving finite automata by finite... more
ABSTRACT In this paper we study expressiveness of evolutionary computation. To do so we introduce evolutionary automata and define their several subclasses. To our surprise, we got the result that evolving finite automata by finite automata leads outside its class, and allows to express for example pushdown automata or Turing machines. This explains partially why Larry Fogel restricted representation in Evolutionary Programming to finite state machines only. The power of evolution is enormous indeed!
Research Interests: Quantum Computing, Computational Modeling, Evolutionary Computation, Genetic Programming, Quantum Mechanics, and 10 moreAutomata, Convergence, Finite Automata, Evolutionary Computing, Turing machine, Scalability, Finite state machines, Turing Machines, Evolutionary Programming, and Finite State Machine
Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the... more
Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the population using evolutionary computation techniques. It is justified that evolutionary algorithms are more expressive than conventional recursive algorithms. Three subclasses of evolutionary algorithms are proposed here: bounded finite, unbounded finite and infinite types. Some results on completeness, optimality and search decidability for the above classes are presented. A natural extension of Evolutionary Turing Machine model developed in this paper allows one to mathematically represent and study properties of cooperation and competition in a population of optimized species.
Research Interests:
ABSTRACT 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... more
ABSTRACT 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.
ABSTRACT While evolution has inspired algorithmic methods of heuristic optimization, little has been done in the way of using concepts of computation to advance our understanding of salient aspects of biological phenomena. The authors... more
ABSTRACT While evolution has inspired algorithmic methods of heuristic optimization, little has been done in the way of using concepts of computation to advance our understanding of salient aspects of biological phenomena. The authors argue under reasonable assumptions, interesting conclusions can be drawn that are of relevance to behavioral evolution. The authors will focus on two important features of life---robustness and fitness---which, they will argue, are related to algorithmic probability and to the thermodynamics of computation, disciplines that may be capable of modeling key features of living organisms, and which can be used in formulating new algorithms of evolutionary computation.
Research Interests:
ABSTRACT The aim of this paper is the development of foundations for evolutionary computation. We introduce and study two classes of evolutionary automata: bounded and periodic evolutionary machines.
Research Interests:
... the way medicine is taught and delivered by providing a more effective training and ... The renderingsoftware is Sense8's 3D/VR WorldToolKit which was used to control devices and ... the wholesimulation with different initial... more
... the way medicine is taught and delivered by providing a more effective training and ... The renderingsoftware is Sense8's 3D/VR WorldToolKit which was used to control devices and ... the wholesimulation with different initial data and track all directions of the process development. ...
Research Interests:
ABSTRACT The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata... more
ABSTRACT The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines. Various subclasses and modes of evolutionary computation are defined. Problems of existence of universal objects in these classes are explored. Relations between Turing machines, inductive Turing machines, evolutionary Turing machines, and evolutionary inductive Turing machines are investigated.
Research Interests:
A survey is given of some results on the complexity of algorithms and computations published up to 1973.
Research Interests:
ABSTRACT An algorithmic uniform method to measure the complexity of finitely refutable statements [6, 7, 9] was used to classify famous/interesting mathematical statements like Fermat's last theorem, the four colour theorem, and... more
ABSTRACT An algorithmic uniform method to measure the complexity of finitely refutable statements [6, 7, 9] was used to classify famous/interesting mathematical statements like Fermat's last theorem, the four colour theorem, and the Riemann hypothesis [8, 15, 16]. Working with inductive Turing machines of various orders [1] instead of classical computations, we propose a class of inductive complexity measures and inductive complexity classes for mathematical statements which generalise the previous method. In particular, the new method is capable to classify Π2–statements. As illustrations, we evaluate the inductive complexity of the Collatz and twin prime conjectures — statements which cannot be evaluated with the original method.