相关论文: On Invariance and Convergence in Time Complexity t…

In this paper, it is shown why Lorentz Transformation implies the general case where observed events are not necessarily in the inertia frame of any observer but assumes a special scenario when determining the length contraction and time…

This article finds the answer to the question: for any problem from which a non-deterministic algorithm can be derived which verifies whether an answer is correct or not in polynomial time (complexity class NP), is it possible to create an…

This article aims to explain essential elements of perturbation theory and their conceptual underpinnings. It is not meant as a summary of popular perturbation methods, though some illustrative examples are given to underline the main…

In this paper, we first study convergence rates in the law of large numbers for independent and identically distributed random variables. We obtain a strong $L^p$-convergence version and a strongly almost sure convergence version of the law…

The concepts of the perfect system and degeneracy are introduced. A special symmetry is found which is related to the entropy invariant. The inversion relation of system is obtained which is used to give the oppsite direction of time to…

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

We prove that NL is strictly contained in P. We get this separation as a corollary of the following result: the set of context-free languages is not contained in NL. The reader should recall that CFL is contained in DTIME(n^3)

We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $\varphi$, the proportion of objects satisfying $\varphi$ converges to a limiting value as the size of the objects tends to…

In this work, we develop a formal system of inductive logic. It uses an infinitary language that allows for countable conjunctions and disjunctions. It is based on a set of nine syntactic rules of inductive inference, and contains classical…

We propose the Transcendental Encoding Conjecture for decision problems, which asserts that every language in complexity class P encodes to an algebraic real (possibly rational or algebraic irrational) under its binary characteristic…

We look afresh at the deduction of the "Lorentz contraction" of a "rod" from the Lorentz transformation equations of the special theory of relativity. We show that under special conditions, which include acceleration of the "rod", length…

We define and study a new notion of "robust simulations" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of "significant…

In the local, characteristic 0, non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We prove that such distributions are invariant by transposition. This implies that an…

A variant of the divergence theory for vacuum-condensation developed in a previous communication is analyzed from the viewpoint of a 'time' asymmetric law in vacuum. This law is found to establish a substantial distinction between…

This paper deals with strong invariance principles (known also as strong approximation theorems) for sums of the form $\sum_{n=1}^{[Nt]}F\big(X(n),X(2n),...,X(kn), X(q_{k+1}(n)),X(q_{k+2}(n)),..., X(q_\ell(n))\big)$

We investigate machine models similar to Turing machines that are augmented by the operations of a first-order structure $\mathcal{R}$, and we show that under weak conditions on $\mathcal{R}$, the complexity class $\text{NP}(\mathcal{R})$…

The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…

Convergence theory is an extension of general topology. In contrast with topology, it is closed under some important operations, like exponentiation. With all its advantages, convergence theory remains rather unknown. It is an aim of this…

The following three sections and appendices are taken from my thesis "The Foundations of Inference and its Application to Fundamental Physics" from 2021, in which I construct a theory of entropic inference from first principles. The…

We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…