Results 31 to 40 of about 50,371 (207)
Computer als Modelle des Geistes
Österreichische Zeitschrift für Geschichtswissenschaften, 2008 The article considers the complexities of thinking about the computer as a model of the mind. It examines the computer as being a model of the brain in several very different senses of ‚model‘.
Peter Asaro
doaj +1 more source
Fuzzy Kolmogorov Complexity Based on a Classical Description
Entropy, 2020 In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string.
Songsong Dai
doaj +1 more source
Transformation of Turing Machines into Context-Dependent Fusion Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Context-dependent fusion grammars were recently introduced as devices for the generation of hypergraph languages. In this paper, we show that this new type of hypergraph grammars, where the application of fusion rules is restricted by positive and ...
Aaron Lye
doaj +1 more source
Universal Grammar Is a Universal Grammar [PDF]
, 2014 Is Universal Grammar a universal grammar? From Chomsky's hierarchy we deduce that for each grammar there is a Turing machine, and conversely. Following this equivalence, it is immediate to conclude that a universal Turing machine is equivalent to a ...
Casares, Ramón
core +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
Natural Halting Probabilities, Partial Randomness, and Zeta Functions [PDF]
, 2006 We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity.
C. S. Calude +4 more
core +6 more sources
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
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
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
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