English
Related papers

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

200 papers

We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable…

Logic · Mathematics 2015-07-01 Dag Normann

We investigate the two-dimensional Muskat problem with a nonlinear elastic interface, for both one-phase and two-phase scenarios. Following the framework developed by Nguyen [35,36], we demonstrate that the problem is locally well-posed in…

Analysis of PDEs · Mathematics 2026-01-06 Lizhe Wan , Jiaqi Yang

In this paper, we investigate the existence and uniqueness of fixed point for partially ordered contraction type operators in Banach Space. We also present applications to integral and differential equations.

Functional Analysis · Mathematics 2017-10-17 Jinxiu Mao , Zengqin Zhao

BSS RAMs were introduced to provide a mathematical framework for characterizing algorithms over first-order structures. Non-deterministic BSS RAMs help to model different non-deterministic approaches. Here, we deal with different types of…

Logic · Mathematics 2025-10-31 Christine Gaßner

A general fixed point theorem for isometries in terms of metric functionals is proved under the assumption of the existence of a conical bicombing. It is new even for isometries of Banach spaces as well as for non-locally compact…

Functional Analysis · Mathematics 2023-01-19 Anders Karlsson

In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy…

Logic in Computer Science · Computer Science 2016-12-23 Felipe S. Abrahão

We consider linear bounded operators acting in Banach spaces with a basis, such operators can be represented by an infinite matrix. We prove that for an invertible operator there exists a sequence of invertible finite-dimensional operators…

Functional Analysis · Mathematics 2024-03-12 Alexander Vasilyev , Vladimir Vasilyev , Abu Bakarr Kamanda Bongay

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…

Optimization and Control · Mathematics 2020-11-19 Nathanaël Fijalkow , Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

A non-autonomous evolution semi-linear differential system under non-instantaneous impulses, delays, and perturbed by non-local conditions is studied. Its piece-wise continuous solutions belong to a finite-dimensional Banach space. The…

Optimization and Control · Mathematics 2022-03-14 Sebastiàn Lalvay , Adriàn Padilla-segarra , Walid Zouhair

The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…

Formal Languages and Automata Theory · Computer Science 2020-03-31 Laure Daviaud , Marcin Jurdziński , Ranko Lazić , Filip Mazowiecki , Guillermo A. Pérez , James Worrell

We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Michael Papadimitrakis

This paper uses the resolvent operator technique to investigate second-order non-autonomous neutral integrodifferential equations with impulsive conditions in a Banach space. We study the existence of a mild solution and the system's…

Dynamical Systems · Mathematics 2023-12-05 Asma Afreen , Abdur Raheem , Areefa Khatoon

This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable for general probabilistic automata, without restriction on…

Formal Languages and Automata Theory · Computer Science 2011-04-18 Nathanaël Fijalkow , Hugo Gimbert , Youssouf Oualhadj

The upper limit on what is computable in our universe is unknown, but widely believed to be set by the Turing machine -- with a function being physically computable if and only if it is Turing-computable. I show how this apparently mild…

History and Philosophy of Physics · Physics 2024-10-16 Toby Ord

L. Boltzmann proposed a billiard model with a planar central force problem reflected against a line not passing through the center. He asserted that such a system is ergodic, which thus illustrates his ergodic hypothesis. However, it has…

Dynamical Systems · Mathematics 2023-11-17 Michael Plum , Airi Takeuchi , Lei Zhao

First, we show that universality and other properties of general jumping finite automata are undecidable, which answers a question asked by Meduna and Zemek in 2012. Second, we close the study raised by \v{C}erno and Mr\'{a}z in 2010 by…

Formal Languages and Automata Theory · Computer Science 2015-11-30 Vojtěch Vorel

In this paper, the existence and uniqueness of solution of the Cauchy problem for abstract Boussinesq equation is obtained. By applying this result, the Cauchy problem for systems of Boussinesq equations of finite or infinite orders are…

Analysis of PDEs · Mathematics 2017-06-06 Veli Shakhmurov

In this note we investigate the asymptotic behavior of the number of maximum modulus points, of an entire function, sitting in a disc of radius $r$. In 1964, Erd\Humlaut{o}s asked whether there exists a non-monomial function so that this…

Complex Variables · Mathematics 2023-09-28 Adi Glücksam , Leticia Pardo-Simón

One Counter Nets (OCNs) are finite-state automata equipped with a counter that cannot become negative, but cannot be explicitly tested for zero. Their close connection to various other models (e.g., PDAs, Vector Addition Systems, and…

Formal Languages and Automata Theory · Computer Science 2024-11-19 Shaull Almagor , Michaël Cadilhac , Asaf Yeshurun

We carry out a systematic study of decidability for theories of (a) real vector spaces, inner product spaces, and Hilbert spaces and (b) normed spaces, Banach spaces and metric spaces, all formalised using a 2-sorted first-order language.…

Logic · Mathematics 2012-05-17 Robert M. Solovay , R. D. Arthan , John Harrison
‹ Prev 1 3 4 5 6 7 10 Next ›