Results 11 to 20 of about 1,963 (247)
Randomness and dimension in computational learning and analog computation [PDF]
, 2022 In this thesis, we study the notion of algorithmic randomness and its refinement, algorithmic dimension, in the contexts of learning theory and analog computation. Zaffora Blando (2021) recently characterized algorithmic randomness in terms of computable
Migunov, Andrei Nikolai
core +1 more source
On New Notions of Algorithmic Dimension, Immunity, and Medvedev Degree [PDF]
, 2022 We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing dimensions.
Webb, David J.
core +2 more sources
Dimension-adaptive bounds on compressive FLD Classification [PDF]
, 2013 Efficient dimensionality reduction by random projections (RP) gains popularity, hence the learning guarantees achievable in RP spaces are of great interest.
Kabán, Ata +3 more
core +1 more source
Algorithmic randomness and analysis [PDF]
, 2017 In this thesis we study the interaction between algorithmic randomness and mathematical analysis. In particular, we focus on the connection between analysis and the fields of effective dimension and resource bounded randomness.
Stull, Donald
core +1 more source
, 2007 We consider algorithmic randomness in the Cantor space C of the infinite binary sequences. By an algorithmic randomness concept one specifies a set of elements of C, each of which is assigned the property of being random.
Mihailovic, Nenad
core +1 more source
Mutual dimension, data processing inequalities, and randomness [PDF]
, 2016 This dissertation makes progress in the area of constructive dimension, an effectivization of classical Hausdorff dimension. Using constructive dimension, one may assign a non-zero number to the dimension of individual sequences and individual points in ...
Case, Adam
core +1 more source
Computability and Fractal Dimension [PDF]
, 2004 This thesis combines computability theory and various notions of fractal dimension, mainly Hausdorff dimension. An algorithmic approach to Hausdorff measures makes it possible to define the Hausdorff dimension of individual points instead of sets in a ...
Reimann, Jan
core +1 more source
G\'acs-Ku\v{c}era's Theorem Revisited by Levin [PDF]
, 2023 Leonid Levin (arxiv.org/abs/cs/0503039v14, p.7) published a new (and very nice) proof of G\'acs-Ku\v{c}era's theorem that occupies only a few lines when presented in his style.
Shen, Alexander, Barmpalias, George
core +1 more source
Distinguishing between apparent and actual randomness: a preliminary examination with Australian ants [PDF]
, 2018 The correlated random walk paradigm is the dominant conceptual framework for modeling animal movement patterns. Nonetheless, we do not know whether the randomness is apparent or actual.
Ken Cheng +5 more
core +1 more source
An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems [PDF]
, 2019 We introduce a conceptual framework and an interventional calculus to steer and manipulate systems based on their intrinsic algorithmic probability using the universal principles of the theory of computability and algorithmic information.
Zenil, Hector +7 more
core +1 more source