English
Related papers

Related papers: A Comment on Budach's Mouse-in-an-Octant Problem

200 papers

The $m$-point nonlocal problem for the first order differential equation with an operator coefficient in a Banach space $X$ is considered. An exponentially convergent algorithm is proposed and justified provided that the operator…

Numerical Analysis · Mathematics 2010-01-27 Vitalii Vasylyk , Dmytro Sytnyk

This paper considers two commuting smooth transformations on a Banach space, and proves the sub-additivity of the measure theoretic entropies under mild conditions. Furthermore, some additional conditions are given for the equality of the…

Dynamical Systems · Mathematics 2025-07-31 ChiYi Luo , Yun Zhao

This paper reviews and suggests a resolution of the problem of definite outcomes of measurement. This problem, also known as "Schrodinger's cat," has long posed an apparent paradox because the state resulting from a measurement appears to…

Quantum Physics · Physics 2022-06-14 Art Hobson

In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…

History and Overview · Mathematics 2022-06-01 Katie Buchhorn

Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive…

Formal Languages and Automata Theory · Computer Science 2018-09-26 Christof Löding , Anton Pirogov

The inner alignment problem, which asserts whether an arbitrary artificial intelligence (AI) model satisfices a non-trivial alignment function of its outputs given its inputs, is undecidable. This is rigorously proved by Rice's theorem,…

In this paper we study the Cauchy problem for overdetermined systems of linear partial differential operators with constant coefficients in some spaces of $\omega$-ultradifferentiable functions in the sense of Braun, Meise and Taylor, for…

Analysis of PDEs · Mathematics 2017-05-17 Chiara Boiti , Elisabetta Gallucci

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

Logic · Mathematics 2017-01-11 Eike Neumann

Higher-order beta-matching is the following decision problem: given two simply typed lambda-terms, can the first term be instantiated to be beta-equivalent to the second term? This problem was formulated by Huet in the 1970s and shown…

Logic in Computer Science · Computer Science 2026-02-03 Andrej Dudenhefner

This paper considers overdetermined boundary problems. Firstly, we give a proof to the Payne-Schaefer conjecture about an overdetermined problem of sixth order in the two dimensional case and under an additional condition for the case of…

Analysis of PDEs · Mathematics 2021-10-06 Changyu Xia

We consider the shift operator $M_z$, defined on the Bloch space and the little Bloch space and we study the corresponding lattice of invariant subspaces. The index of a closed invariant subspace $E$ is defined as $\text{ind}(E) =…

Functional Analysis · Mathematics 2024-09-06 Nikiforos Biehler

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,…

Quantum Physics · Physics 2012-07-20 J. Eisert , M. P. Mueller , C. Gogolin

We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Uğur Küçük , A. C. Cem Say , Abuzer Yakaryılmaz

We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…

Group Theory · Mathematics 2019-04-26 Sebastián Barbieri , Jarkko Kari , Ville Salo

In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…

Combinatorics · Mathematics 2023-10-26 Rachel Greenfeld , Terence Tao

Dirichlet problem in an $n$-dimensional billiard space is investigated. In particular, the system of ODEs $\ddot x(t) = f(t,x(t))$ together with Dirichlet boundary conditions $x(0) = A$, $x(T) = B$ in an $n$-dimensional interval $K$ with…

Classical Analysis and ODEs · Mathematics 2022-04-26 Grzegorz Gabor , Jan Tomeček

We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…

Logic in Computer Science · Computer Science 2015-02-18 Mikołaj Bojańczyk , Paweł Parys , Szymon Toruńczyk

The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10…

Quantum Physics · Physics 2026-01-16 Laura Castilla-Castellano , Angelo Lucia

In this paper, we consider the Cauchy problem for $(abcd)$-Boussinesq system posed on one- and two-dimensional Euclidean spaces. This model, initially introduced by Bona, Chen, and Saut, describes a small-amplitude waves on the surface of…

Analysis of PDEs · Mathematics 2021-02-03 Chulkwang Kwak , Christopher Maulén

It is undecidable whether the language recognized by a probabilistic finite automaton is empty. Several other undecidability results, in particular regarding problems about matrix products, are based on this important theorem. We present…

Formal Languages and Automata Theory · Computer Science 2024-06-07 Günter Rote