Results 41 to 50 of about 50,371 (207)
A generalized characterization of algorithmic probability [PDF]
, 2016 An a priori semimeasure (also known as "algorithmic probability" or "the Solomonoff prior" in the context of inductive inference) is defined as the transformation, by a given universal monotone Turing machine, of the uniform measure on the infinite ...
Sterkenburg, Tom F.
core +4 more sources
Reductions to the set of random strings: The resource-bounded case [PDF]
Logical Methods in Computer Science, 2014 This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings.
Eric Allender +3 more
doaj +1 more source
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
Applied Sciences, 2021 Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics.
Aritra Sarkar, Zaid Al-Ars, Koen Bertels
doaj +1 more source
Probing quantum-classical boundary with compression software [PDF]
, 2015 We experimentally demonstrate that it is impossible to simulate quantum bipartite correlations with a deterministic universal Turing machine. Our approach is based on the Normalized Information Distance (NID) that allows the comparison of two pieces of ...
Cerè, Alessandro +5 more
core +2 more sources
The universal turing machine: A half-century survey
Science of Computer Programming, 1990 Wlad Turski
openalex +3 more sources
Entropy, 2020 Although natural and bioinspired computing has developed significantly, the relationship between the computational universality and efficiency beyond the Turing machine has not been studied in detail.
Yukio-Pegio Gunji, Daisuke Uragami
doaj +1 more source
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy [PDF]
, 2014 In the 1960's Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselectors. Recently, Glaschick reverse engineered the program of one of these machines and found that it is a universal Turing machine. In fact, its program uses
Glaschick, Rainer +3 more
core +2 more sources
Universal Cellular Automata and Class 4 [PDF]
, 1994 Wolfram has provided a qualitative classification of cellular automata(CA) rules according to which, there exits a class of CA rules (called Class 4) which exhibit complex pattern formation and long-lived dynamical activity (long transients).
A.R. Smith III +17 more
core +3 more sources
About Shannon's problem for turing machines [PDF]
Computer Science Journal of Moldova, 1993 Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
Yu. Rogozhin
doaj
Artificial Intelligence and Human Intellect [PDF]
Journal of Systemics, Cybernetics and Informatics, 2021 Many philosophers, computer scientists, and cyberneticists still consider it possible that a computer, described as a Turing machine, can effectively have intelligence.
Víctor Velarde-Mayol
doaj