Results 11 to 20 of about 1,725,284 (283)
Algorithmic Cross-Complexity and Relative Complexity [PDF]
2009 Data Compression Conference, 2009 Information content and compression are tightly related concepts that can be addressed by classical and algorithmic information theory. Several entities in the latter have been defined relying upon notions of the former, such as entropy and mutual information, since the basic concepts of these two approaches present many common tracts.
Daniele Cerra, Mihai Datcu
openaire +5 more sources
Binarized neural networks converge toward algorithmic simplicity: empirical support for the learning-as-compression hypothesis [PDF]
Frontiers in Computational NeuroscienceUnderstanding and controlling the complexity of neural networks is a central challenge in machine learning, with implications for generalization, optimization, and model capacity. While most approaches rely on entropy-based loss functions and statistical
Eduardo Y. Sakabe +14 more
doaj +2 more sources
How Complexity and Uncertainty Grew with Algorithmic Trading
Entropy, 2020 The machine-learning paradigm promises traders to reduce uncertainty through better predictions done by ever more complex algorithms. We ask about detectable results of both uncertainty and complexity at the aggregated market level.
Martin Hilbert, David Darmon
doaj +3 more sources
The Boltzmann Entropy and Randomness Tests [PDF]
EntropyIn the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”.
Peter Gács
doaj +2 more sources
Notions and applications of algorithmic randomness [PDF]
, 2013 Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy,
Vermeeren, Stijn
core +6 more sources
Algorithmic Folding Complexity [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean Cardinal +8 more
openaire +8 more sources
The Complexity of Cryptocurrencies Algorithmic Trading
Mathematics, 2022 In this research, we provided an answer to a very important trading question, what is the optimal number of technical tools in order to achieve the best trading results for both swing trade that uses daily bars and intraday trade that uses minutes bars ...
Gil Cohen, Mahmoud Qadan
doaj +1 more source
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility [PDF]
PeerJ Computer Science, 2015 We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine.
Hector Zenil +3 more
doaj +2 more sources
Algorithmic reconstruction of glioblastoma network complexity
iScience, 2022 Summary: Glioblastoma is a complex disease that is difficult to treat. Network and data science offer alternative approaches to classical bioinformatics pipelines to study gene expression patterns from single-cell datasets, helping to distinguish genes ...
Abicumaran Uthamacumaran, Morgan Craig
doaj +1 more source
The Austrian School and Mathematics: Reconsidering Methods in Light of Complexity Economics
Quarterly Journal of Austrian Economics, 2023 This article reconsiders the Austrian school’s historical position regarding the role of mathematics in economics in light of complexity economics’ approach to this issue.
Vicente Moreno-Casas
doaj +1 more source