中文
相关论文

相关论文: The Arithmetical Complexity of Dimension and Rando…

200 篇论文

A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive…

计算复杂性 · 计算机科学 2007-05-23 Jack H. Lutz

If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of Billingsley…

计算复杂性 · 计算机科学 2008-11-13 Jack H. Lutz

If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of Billingsley…

计算复杂性 · 计算机科学 2009-06-24 Jack H. Lutz

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim_H(S) and constructive packing dimension dim_P(S) is Turing…

计算复杂性 · 计算机科学 2010-04-09 Laurent Bienvenu , David Doty , Frank Stephan

We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove…

逻辑 · 数学 2009-08-04 Olivier Finkel , Dominique Lecomte

A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound \Delta (a parameter of the theory) is unrestricted, the resulting dimension is precisely the…

计算复杂性 · 计算机科学 2007-05-23 Jack H. Lutz

In this article, we study the relationship between notions of depth for sequences, namely, Bennett's notions of strong and weak depth, and deep $\Pi^0_1$ classes, introduced by the authors and motivated by previous work of Levin. For the…

计算机科学中的逻辑 · 计算机科学 2024-03-08 Laurent Bienvenu , Christopher P. Porter

The existence of a well-behaved dimension of a finite von Neumann algebra (see [19]) has lead to the study of such a dimension of finite Baer *-rings (see [26]) that satisfy certain *-ring axioms (used in [9]). This dimension is closely…

环与代数 · 数学 2013-02-05 Lia Vas

Consider all the level sets of a real function. We can group these level sets according to their Hausdorff dimensions. We show that the Hausdorff dimension of the collection of all level sets of a given Hausdorff dimension can be…

经典分析与常微分方程 · 数学 2016-08-29 Gavin Armstrong

In this paper, we study Hausdorff and Fourier dimension from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity. Working in the hyperspace $\mathbf{K}(X)$ of compact subsets of $X$, with $X=[0,1]^d$ or…

逻辑 · 数学 2023-01-04 Alberto Marcone , Manlio Valenti

We show that a sequence has effective Hausdorff dimension 1 if and only if it is coarsely similar to a Martin-L\"{o}f random sequence. More generally, a sequence has effective dimension $s$ if and only if it is coarsely similar to a weakly…

逻辑 · 数学 2017-09-18 Noam Greenberg , Joe Miller , Alexander Shen , Linda Brown Westrick

An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…

逻辑 · 数学 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

逻辑 · 数学 2023-05-12 Barbara F. Csima , Dino Rossegger

A set of infinite binary sequences $\mathcal{C}\subseteq2^\omega$ is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probability. The study of negligibility is of particular…

逻辑 · 数学 2017-01-31 Laurent Bienvenu , Christopher P. Porter

Let $A$ be a unital associative PI-algebra over a field of characteristic zero. We study which partitions $\lambda$ appear with nonzero multiplicities in the cocharacter sequence of $A$ for several classes of algebras $A$. Berele defines…

环与代数 · 数学 2026-02-24 Elitza Hristova

In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…

逻辑 · 数学 2024-01-23 Jakub Tomaszewski

This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual…

计算复杂性 · 计算机科学 2017-01-17 Neil Lutz , D. M. Stull

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

群论 · 数学 2007-06-30 Ilya Kapovich , Paul Schupp

Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…

动力系统 · 数学 2018-10-15 Tomas Persson

The dimension algebra of graded groups is introduced. With the help of known geometric results of extension theory that algebra induces all known results of the cohomological dimension theory. Elements of the algebra are equivalence classes…

代数拓扑 · 数学 2008-02-27 Jerzy Dydak
‹ 上一页 1 2 3 10 下一页 ›