Results 91 to 100 of about 50,371 (207)
The ISSN and the Turing machines: the history of a relationship
On the unending path towards a better integration of the ISSN and its accompanying metadata in the semantic web, the new horizon is that of linked data, so as to make sure that ISSN data is fully linkable for universal computing.
Pierre Godefroy
doaj
Stochastic thermodynamics for biological functions
Abstract Living systems operate within physical constraints imposed by nonequilibrium thermodynamics. This review explores recent advancements in applying these principles to understand the fundamental limits of biological functions. We introduce the framework of stochastic thermodynamics and its recent developments, followed by its application to ...
Yuansheng Cao, Shiling Liang
wiley +1 more source
Very Simple Chaitin Machines for Concrete AIT
In 1975, Chaitin introduced his celebrated Omega number, the halting probability of a universal Chaitin machine, a universal Turing machine with a prefix-free domain.
Stay, Michael
core +1 more source
Computing A Glimpse of Randomness
A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random (its binary ...
C. -k. Shu+5 more
core +4 more sources
Development of communication science, computer science and cybernetics in the 1940s – 1950s
This publication presents the emergence of the new sciences that are most important for today’s world: communication science, cybernetics, the theory of information, and the theory of the noosphere in the 1940s – 1950s.
Denis Kislov
doaj +1 more source
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation [PDF]
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems notable by its absence: Where are the programs? We identify a number of common
L. Hartmann+3 more
doaj
Two railway circuits: a universal circuit and an NP-difficult one [PDF]
In this paper, first we construct a railway circuit based on three types of switches and on crossings. Such a circuit is able to simulate the computation of any Turing machine, in particular of a universal one. That result was proved by Ian Stewart in [3]
Maurice Margenstern
doaj
A Generating Distorted CAPTCHA Images Using a Machine Learning Algorithm
CAPTCHAs (Completely Automated Public Turing Test to Tell Computers and Humans Apart) have become universal in web security systems to differentiate between automated bots and human users.
Saba Abdulbaqi Salman +2 more
doaj +1 more source
A Self-Replicating Universal Turing Machine [PDF]
Héctor Fabio Restrepo+2 more
openalex +1 more source
What can we learn from universal Turing machines? [PDF]
Maurice Margenstern
openalex +3 more sources