Related papers: Reachability for infinite time Turing machines wit…

In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n\log n, in…

We improve some results of Pavlov and of Filatova, respectively, concerning a problem of Malychin by showing that every regular space X that satisfies Delta(X)>ext(X) is omega-resolvable. Here Delta(X), the dispersion character of X, is the…

Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol.22, pp.329-340, 1975] introduced \Omega number as a concrete example of random real. The real \Omega is defined as the probability that an optimal computer halts, where the optimal…

Let $\Omega \subset \mathbb{R}^{n+1}$, $n \geq 1$, be an open and connected set. Set $\mathcal{T}_n$ to be the set of points $\xi \in \partial \Omega$ so that there exists an approximate tangent $n$-plane for $\partial\Omega$ at $\xi$ and…

We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter)…

The capacity of finite state channels (FSCs) has been established as the limit of a sequence of multi-letter expressions only and, despite tremendous effort, a corresponding finite-letter characterization remains unknown to date. This paper…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Let $\mathcal{M}$ be a semifinite von Neumann algebra on a Hilbert space $\mathcal{H}$ equipped with a faithful normal semifinite trace $\tau$, $S(\mathcal{M},\tau)$ be the ${}^*$-algebra of all $\tau$-measurable operators. Let…

Can a computer which runs for time $\omega^2$ compute more than one which runs for time $\omega$? No. Not, at least, for the infinite computer we describe. Our computer gets more powerful when the set of its steps gets larger. We prove that…

Let M be an arbitrary Riemannian homogeneous space, and let Omega be a space of tilings of M, with finite local complexity (relative to some symmetry group Gamma) and closed in the natural topology. Then Omega is the inverse limit of a…

Let $\Omega\in L^1{({\mathbb S^{n-1}})}$, be a function of homogeneous of degree zero, and $M_\Omega$ be the Hardy-Littlewood maximal operator associated with $\Omega$ defined by $M_\Omega(f)(x) =…

Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…

We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…

We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of…

We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…

We show how to assign labels of size $\tilde O(1)$ to the vertices of a directed planar graph $G$, such that from the labels of any three vertices $s,t,f$ we can deduce in $\tilde O(1)$ time whether $t$ is reachable from $s$ in the graph…

The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph…

We prove that a bounded linear operator $T$ is a direct sum of an invertible operator and an operator with at most countable spectrum iff $0\notin\mbox{acc}^{\omega_{1}}\,\sigma(T),$ where $\omega_{1}$ is the smallest uncountable ordinal…

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of…