相关论文: Computability Superselection Rule and its physical…

This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and…

I am most honoured to have the privilege to present the Foreword to this fascinating and wonderfully varied collection of contributions, concerning the nature of computation and of its deep connection with the operation of those basic laws,…

An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…

This paper has been withdrawn due to crucial erros in equations (24)--(31).

The role of geometrically infinitely divisible laws in renewal equations and superposition of renewal processes are explored here. Some examples are also discussed.

Two-stage superposition choice procedures, which sequentially apply two choice procedures so that the result of the first choice procedure is the input for the second choice procedure, are studied. We define which of them satisfy given…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

The paper offers a contribution to the interdisciplinary constructs of analyzing fairness issues in automatic algorithmic decisions. Section 1 shows that technical choices in supervised learning have social implications that need to be…

We present recommendations to improve reproducibility and replicability in condensed matter physics. This area of physics has consistently produced both fundamental insights into the workings of matter and transformative inventions. Our…

This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.

Correction to Annals of Probability 29 (2001) 1612--1624 [doi:10.1214/aop/1015345764].

This is a pedagogical article cited in the foregoing research note, quant-ph/9911050

This manuscript has been removed duo to incorrect contents.

This paper has been withdrawn by the author due to a error in attachment of source file.

The content of this paper is now available as part of arXiv:0802.2019

We introduce a new, substantially simplified version of the toggling-branching recurrence operation of Computability Logic, prove its equivalence to Japaridze's old, "canonical" version, and also prove that both versions preserve the static…

The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…

A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…

Some elementary rigorous remark about the replica formalism in the Statistical Physics' approach to threshold phenomena in Computational Complexity Theory is presented.

Established frameworks to understand problems with reproducibility in science begin with the relationship between our understanding of the prior probability of a claim and the statistical certainty that should be demanded of it, and explore…