[BUCH][B] Theory of knowledge: structures and processes
M Burgin - 2016 - books.google.com
This book aims to synthesize different directions in knowledge studies into a unified theory of
knowledge and knowledge processes. It explicates important relations between knowledge …
knowledge and knowledge processes. It explicates important relations between knowledge …
Cloud computing based on agent technology, super-recursive algorithms and DNA
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 …
variety of fields such as ubiquitous computing, ambient intelligence, autonomous computing …
Inductive complexity and shannon entropy
M Burgin - Information and complexity, 2017 - World Scientific
Shannon's approach based on the concept of entropy became the mainstream information
theory. Although some think that this direction represents information theory as the whole …
theory. Although some think that this direction represents information theory as the whole …
Inductive Complexity of the p Versus np Problem
This paper does not propose a solution, not even a new possible attack, to the P versus NP
problem. We are asking the simpler question: How “complex” is the P versus NP problem …
problem. We are asking the simpler question: How “complex” is the P versus NP problem …
Super-recursive algorithms and modes of computation
M Burgin - Proceedings of the 2015 European Conference on …, 2015 - dl.acm.org
According to the contemporary computer science, working in the functional recursive mode,
computers and computer networks function as recursive algorithms. At the same time …
computers and computer networks function as recursive algorithms. At the same time …
Inductive complexity of Goodstein's theorem
J Hertel - … : 11th International Conference, UCNC 2012, Orléan …, 2012 - Springer
LNCS 7445 - Inductive Complexity of Goodstein’s Theorem Page 1 J. Durand-Lose and N.
Jonoska (Eds.): UCNC 2012, LNCS 7445, pp. 141–151, 2012. © Springer-Verlag Berlin …
Jonoska (Eds.): UCNC 2012, LNCS 7445, pp. 141–151, 2012. © Springer-Verlag Berlin …
[HTML][HTML] The four-color theorem of map-making proved by construction
JW Oller Jr - Open Access Library Journal, 2016 - scirp.org
The objective of this paper is to prove by simple construction, generalized by induction, that
the bounded areas on any map, such as found on the surface of a sheet of paper or a …
the bounded areas on any map, such as found on the surface of a sheet of paper or a …
m-Stability, Asymptotic Behavior And Properties Of A Class Of Covariant Nonlinear Multi-Agent Systems.
MCI Nwogugu - 2023 - papers.ssrn.com
The equation x^ a+ y^ b+ z^ c= m in real numbers represents a group of Nonlinear Multi-
Agent Systems, is an ill-posed problem and can be used in physical sciences and social …
Agent Systems, is an ill-posed problem and can be used in physical sciences and social …
Symmetric Automata and Computations
M Burgin - Handbook of Unconventional Computing: VOLUME 1 …, 2022 - World Scientific
The theory of algorithms, automata and computation is aimed at modeling and exploration of
computers, cell phones, computer networks, such as the Internet, and processes in them …
computers, cell phones, computer networks, such as the Internet, and processes in them …
Problems in the system of scientific knowledge
M Burgin - Proceedings, 2017 - mdpi.com
Problems play a crucial role in science. However, to correctly understand this role, it is
necessary to have an adequate model of scientific knowledge. Here we use the most …
necessary to have an adequate model of scientific knowledge. Here we use the most …