Results 31 to 40 of about 55,876 (328)
INSAM, 2023 This study explores the utilization of blockchain data as a set of pseudorandom numbers in the context of microtonal algorithmic composition. Conventional methods of generating indiscriminate numbers often lack the desired levels of unpredictability and ...
Krzysztof Kicior
doaj +1 more source
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
Entropy, 2018 Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths
Hector Zenil +2 more
doaj +1 more source
Proceedings, 2020 Current approaches in science, including most machine and deep learning methods, rely heavily at their core on traditional statistics and information theory, but these theories are known to fail to capture certain fundamental properties of data and the ...
Hector Zenil
doaj +1 more source
An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory
Entropy, 2008 Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity).
Joel Ratsaby
doaj +1 more source
Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments
Entropy, 2012 In evolutionary biology, attention to the relationship between stochastic organisms and their stochastic environments has leaned towards the adaptability and learning capabilities of the organisms rather than toward the properties of the environment ...
David A. Rosenblueth +3 more
doaj +1 more source
Experimental Evidence of Quantum Randomness Incomputability
, 2010 In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an asymptotic property -
Calude, Cristian S. +3 more
core +2 more sources
Uniform distribution and algorithmic randomness
, 2012 A seminal theorem due to Weyl states that if (a_n) is any sequence of distinct integers, then, for almost every real number x, the sequence (a_n x) is uniformly distributed modulo one. In particular, for almost every x in the unit interval, the sequence (
Avigad, Jeremy
core +2 more sources
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Tadaki, Kohtaro, Doi, Norihisa
openaire +2 more sources
RANDOMNESS, UNCERTAINTY, AND COGNITIVE FREEDOM IN THE DATA SOCIETY
Вісник Харківського національного університету імені В.Н. Каразіна. Серия: Теорія культури та філософіі наукиThe modern era of Big Data, in which massive volumes of information and predictive analytics serve as tools for forecasting human behavior, challenges the very notion of free will and personal autonomy.
Kostiantyn Suspitsyn
doaj +1 more source
Random forest missing data algorithms [PDF]
Statistical Analysis and Data Mining: The ASA Data Science Journal, 2017 Random forest (RF) missing data algorithms are an attractive approach for imputing missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings.
Tang, Fei, Ishwaran, Hemant
openaire +4 more sources