Related papers: Towards an axiomatic system for Kolmogorov complex…
It is generally believed that the dynamics of simple fluids can be considered to be chaotic, at least to the extent that they can be modeled as classical systems of particles interacting with short range, repulsive forces. Here we give a…
This paper is concerned with the axiomatic basis of structures within Hypercompositional Algebra. It is proven that the axioms employed in the definition of numerous hypercompositional structures lack independence. Accordingly, novel…
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.
Scientific studies of consciousness rely on objects whose existence is assumed to be independent of any consciousness. On the contrary, we assume consciousness to be fundamental, and that one of the main features of consciousness is…
Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…
We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…
In "Chern classes for coherent sheaves", H.I. Green constructs Chern classes in de Rham cohomology of coherent analytic sheaves. We construct here a formal $(\infty,1)$-categorical framework into which we can place Green's work and…
What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…
We propose a numerical test of fundamental physics based on the complexity measure of a general set of functions, which is directly related to the Kolmogorov (or algorithmic) complexity studied in mathematics and computer science. The…
We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…
The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the…
Many networks in natural and human-made systems exhibit scale-free properties and are small worlds. Now we show that people's understanding of complex systems in their cognitive maps also follow a scale-free topology. People focus on a few…
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
The paper is devoted to an approach to the bounded cohomology theory based on the theories of simplicial sets and Postnikov systems. In particular, the main results of the bounded cohomology theory of topological spaces are extended to…
We start with a review of a class of systems with invariant relations, so called {\it systems of Hess--Appel'rot type} that generalizes the classical Hess--Appel'rot rigid body case. The systems of Hess-Appel'rot type carry an interesting…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…
Kolmogorov nonlinear averaging is complemented by a natural axiom. For this averaging, we prove a theorem on large deviations as well as establish the relationship to the tunnel canonical operator.