English
Related papers

Related papers: A note on the differences of computably enumerable…

200 papers

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…

Number Theory · Mathematics 2025-05-29 S. I. Dimitrov , M. D. Lazarova

We study the empirical meaning of randomness with respect to a family of probability distributions $P_\theta$, where $\theta$ is a real parameter, using algorithmic randomness theory. In the case when for a computable probability…

Machine Learning · Computer Science 2009-06-25 Vladimir V'yugin

Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_{\alpha}(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest…

Logic · Mathematics 2009-09-25 Mitch Rudominer

We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability…

Logic · Mathematics 2016-02-10 Adam R. Day , Jan Reimann

We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…

Group Theory · Mathematics 2023-05-09 Ville Salo

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

Logic · Mathematics 2024-12-19 Yasha Savelyev

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

Logic · Mathematics 2008-02-03 Saharon Shelah

We consider random iteration of exponential entire functions, i.e. of the form ${\mathbb C}\ni z\mapsto f_\lambda(z):=\lambda e^z\in\mathbb C$, $\lambda\in{\mathbb C}\setminus \{0\}$. Assuming that $\lambda$ is in a bounded closed interval…

Dynamical Systems · Mathematics 2018-05-22 Mariusz Urbański , Anna Zdunik

We establish a connection between two variants of van der Corput's Difference Theorem (vdCDT) for countably infinite amenable groups $G$ and the ergodic hierarchy of mixing properties of a unitary representation $U$ of $G$. In particular,…

Dynamical Systems · Mathematics 2024-10-25 Sohail Farhangi

We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…

Logic · Mathematics 2021-02-01 Merlin Carl , Lorenzo Galeotti , Robert Passmann

The main purpose of this paper is to show that we can exploit the difference ($l_1$-norm and $l_2$-norm) in the probability calculation between quantum and probabilistic computations to claim the difference in their space efficiencies. It…

Quantum Physics · Physics 2007-05-23 Masami Amano , Kazuo Iwama , Rudy Raymond

Let $\Gamma$ be a discrete group. When $\Gamma$ is nonamenable, the reduced and full group $C$*-algebras differ and it is generally believed that there should be many intermediate $C$*-algebras, however few examples are known. In this paper…

Operator Algebras · Mathematics 2014-03-21 Matthew Wiersma

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

Logic · Mathematics 2024-07-08 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…

Logic · Mathematics 2023-08-29 Liang Yu

Let us consider a Lie (super)algebra $G$ spanned by $T_{\alpha}$ where $T_{\alpha}$ are quantum observables in BV-formalism. It is proved that for every tensor $c^{\alpha_1...\alpha_k}$ that determines a homology class of the Lie algebra…

High Energy Physics - Theory · Physics 2007-05-23 Albert Schwarz

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

Logic in Computer Science · Computer Science 2011-08-04 Stéphane Le Roux , Martin Ziegler

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Logic · Mathematics 2023-10-11 Paul Shafer

Given a minimal action $\alpha$ of a countable group on the Cantor set, we show that the alternating full group $\mathsf{A}(\alpha)$ is non-amenable if and only if the topological full group $\mathsf{F}(\alpha)$ is $C^*$-simple. This…

Group Theory · Mathematics 2022-09-13 Eduardo Scarparo

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

Logic · Mathematics 2016-02-12 Lu Liu

We show that alpha stable L\'evy motions can be simulated by any ergodic and aperiodic probability preserving transformation. Namely we show: - for $0<\alpha<1$ and every $\alpha$ stable L\'evy motion $\mathbb{W}$, there exists a function f…

Dynamical Systems · Mathematics 2023-09-13 Zemer Kosloff , Dalibor Volný
‹ Prev 1 4 5 6 7 8 10 Next ›