相关论文: Another proof of undecidability for the correspond…

Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which computation and communication is lock-step synchronous but…

Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…

Classically, no information can be transmitted through a depolarising, that is a completely noisy, channel. We show that by combining a depolarising channel with another channel in an indefinite causal order---that is, when there is…

Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…

So far, the theory of equilibrium selection in the infinitely repeated prisoner's dilemma is insensitive to communication possibilities. To address this issue, we incorporate the assumption that communication reduces -- but does not…

The uncertainty relation formulated by Heisenberg in 1927 describes a trade-off between the error of a measurement of one observable and the disturbance caused on another complementary observable so that their product should be no less than…

A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic are common knowledge, then those opinions must be equal. Economists have…

Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…

We consider decision-making under incomplete information about an unknown state of nature. We show that a decision problem yields a higher value of information than another, uniformly across information structures, if and only if it is…

Following a recent paper by N. Mandache (Inverse Problems 17 (2001), pp. 1435-1444), we establish a general procedure for determining the instability character of inverse problems. We apply this procedure to many elliptic inverse problems…

We show undecidability of the satisfiability problem of what is arguably the simplest non-sub-Boolean modal logic with an implicit notion of binding. This work enriches the series of existing results of undecidability of modal logics with…

There are many ways we can not know. Even in systems that we created ourselves, as, for example, systems in mathematical logic, Go\"edel and Tarski's theorems impose limits on what we can know. As we try to speak of the real world, things…

Every known communication problem whose randomized communication cost is constant (independent of the input size) can be reduced to $k$-Hamming Distance, that is, solved with a constant number of deterministic queries to some $k$-Hamming…

Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…

This article explores the following methodological principle for theory construction in physics: if an ontological theory predicts two scenarios that are ontologically distinct but empirically indiscernible, then this theory should be…

When a (frequency-domain) boundary value problem involving a homogeneous linear material is solved to assess the validity of the Post constraint, a conflict arises between the fundamental differential equations of electromagnetism in the…

We consider equivalence and containment problems for word transductions. These problems are known to be undecidable when the transductions are relations between words realized by non-deterministic transducers, and become decidable when…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability…

In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…