Results 31 to 40 of about 1,568 (209)
Simple Turing Machines, Universality, Encodings, etc.
, 2007 Stephen Wolfram
openalex +2 more sources
Reversible Logic Elements with Memory and Their Universality [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used to build ...
Kenichi Morita
doaj +1 more source
Turing Machine Approach To Runtime Software Adaptation
Computer Science, 2014 In this paper, the problem of applying changes to software at runtime is considered. The computability theory is used in order to develop a more general and programming-language-independent model of computation with support for runtime changes.
Jarosław Rudy
doaj +1 more source
Biologically Plausible Boltzmann Machine
Informatics, 2023 The dichotomy in power consumption between digital and biological information processing systems is an intriguing open question related at its core with the necessity for a more thorough understanding of the thermodynamics of the logic of computing.
Arturo Berrones-Santos, Franco Bagnoli
doaj +1 more source
Analogicity in Computer Science. Methodological Analysis
Studies in Logic, Grammar and Rhetoric, 2020 Analogicity in computer science is understood in two, not mutually exclusive ways: 1) with regard to the continuity feature (of data or computations), 2) with regard to the analogousness feature (i.e.
Stacewicz Paweł
doaj +1 more source
Quantum iterative deepening with an application to the halting problem. [PDF]
PLoS ONE, 2013 Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signaling an end of a calculation by setting a halt bit, which needs
Luís Tarrataca, Andreas Wichert
doaj +1 more source
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
How Organisms Come to Know the World: Fundamental Limits on Artificial General Intelligence
Frontiers in Ecology and Evolution, 2022 Artificial intelligence has made tremendous advances since its inception about seventy years ago. Self-driving cars, programs beating experts at complex games, and smart robots capable of assisting people that need care are just some among the successful
Andrea Roli +3 more
doaj +1 more source
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