Related papers: How the no-cloning theorem got its name
It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being routinely carried out. One approach for providing theoretical understanding of this seeming discrepancy is to…
Buchanan et al. [Nature 436, p. 475 (2005)] have shown that it is possible to recognize paper samples via their speckle pattern by using a line-shaped laser focus, four photo detectors and a scanning mechanism. In this report recognition of…
The Talbot-Plateau law specifies what combinations of flash frequency, duration, and intensity will yield a flicker-fused stimulus that matches the brightness of a steady stimulus. It has proven to be remarkably robust in its predictions,…
Holographic algorithms are a recent breakthrough in computer science and has found applications in information theory. This paper provides a proof to the central component of holographic algorithms, namely, the Holant theorem. Compared with…
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
Recent work on fact-checking addresses a realistic setting where models incorporate evidence retrieved from the web to decide the veracity of claims. A bottleneck in this pipeline is in retrieving relevant evidence: traditional methods may…
Is flipping a coin a deterministic process or a random one? We do not allow bounces. If we know the initial velocity and the spin given to the coin, mechanics should predict the face it lands on. However, the coin toss has been everyone's…
Some hypotheses in modern theoretical physics that have not any experimental verification are listed. The goal of the paper is not to criticize or be lawyers any of these hypotheses. The purpose is focus physicists attention on that now…
In this paper we prove that given a black box assumed to generate bits of a given non-recursive real $\Omega$ there is no computable decision procedure generating sequences of decisions such that if the output is indeed $\Omega$ the process…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…
Color transparency (CT) is an effect of suppression of nuclear shadowing of hard reactions, closely related to the color screening. A brief review of theoretical development and experimental search for CT, failed and successful, are…
A recent report of Littmann [Commun. ACM '21] outlines the existence and the fatal impact of collusion rings in academic peer reviewing. We introduce and analyze the problem Cycle-Free Reviewing that aims at finding a review assignment…
In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…
In this paper, using the viewpoint that quantum mechanics can be constructed as a classical field theory without any quantization I build a fully classical theory of thermal radiation. Planck's law for the spectral energy density of thermal…
Michael Handel has proved in [Ha] a fixed point theorem for an orientation preserving homeomorphism of the open unit disk, that turned out to be an efficient tool in the study of the dynamics of surface homeomorphisms. The present article…
This is a revised version (of late 2020) of [Sh:700], which is arXiv:math/0012170 . First point is noting that the proof of Theorem 4.3 in [Sh:700], which says that the proof giving the consistency $ \mathfrak{b} = \mathfrak{d} =…
Algorithmic decision making driven by neural networks has become very prominent in applications that directly affect people's quality of life. In this paper, we study the problem of verifying, training, and guaranteeing individual fairness…
This paper has been withdrawn due to an error in the proof of the termination of the algorithm. Moreover, some ideas of this paper are a joint work with John Perry and it is inappropriate to mention only me as an author. John Perry was in…