Related papers: A Note on Clockability for Ordinal Turing Machines
We study the limit computability of finding a global optimum of a continuous function. We give a short proof to show that the problem of checking whether a point is a global minimum is not limit computable. Thereby showing the same for the…
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating…
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. An analogous problem can be stated in the setting of…
Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…
We extend classical duality results by Weiss on admissible operators to settings where the dual semigroup lacks strong continuity. This is possible using the sun-dual framework, which is not immediate from the duality of the input and…
This paper discusses "computational" systems capable of "computing" functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite…
A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…
Monitoring is an important part of the verification toolbox, in particular in situations where exhaustive verification using, e.g., model-checking is infeasible. The goal of online monitoring is to determine the satisfaction or violation of…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the article proposes for arbitrary Hamiltonians similar integrators,…
Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite computational break this symmetry; we consider ways to recover it and study the resulting model…
The statistical state of any (classical or quantum) system with non-trivial time evolution can be interpreted as the pointer of a clock. The quality of such a clock is given by the statistical distinguishability of its states at different…
We prove that if a countable group $\Gamma$ contains a copy of $\Bbb F_2$, then it admits uncountably many non orbit equivalent actions.
The rapid increase in accuracy and stability of optical atomic clocks compared to the caesium atomic clock as primary standard of time and frequency asks for a future re-definition of the second in the International System of Units (SI).…
This paper discusses how to build a time scale with an intermittently-operated optical clock. In particular, it gives suggestions on how long and how often to run an optical clock. It also explores the benefits of having an optical clock in…
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…
Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…
An oriented graph $H$ is Tur\'anable (resp. tileable) if there exist $n_0 \in \mathbb{N}$ such that every semi-regular near-tournament on $n \ge n_0$ vertices contains a copy of $H$ (resp. a perfect $H$-tiling). We disprove a conjectured…
A permutation group $G\le\operatorname{Sym}(\Omega)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(\Omega)$ has the same orbits on $\Omega\times\Omega$ as $G$. A simple and efficient inductive criterion for…
The allowed patterns of a map are those permutations in the same relative order as the initial segments of orbits realized by the map. In this paper, we characterize and provide enumerative bounds for the allowed patterns of signed shifts,…