Results 71 to 80 of about 2,596,832 (272)
Executable Behaviour and the π-Calculus (extended abstract) [PDF]
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviourally equivalent to the behaviour of a reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
From Code to Life: The AI‐Driven Revolution in Genome Editing
This review explores AI‐driven advancements in genome editing, focusing on CRISPR optimization, enhanced targeting precision, reduced off‐target effects, and novel tool design. It addresses ethical challenges, data biases, and highlights future prospects in precision medicine, agriculture, and synthetic biology.
Zhidong Li+10 more
wiley +1 more source
Problems in number theory from busy beaver competition [PDF]
By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges.
Pascal Michel
doaj +1 more source
Computing with molecules is at the center of complex natural phenomena, where the information contained in ordered sequences of molecules is used to implement functionalities of synthesized materials or to interpret the environment, as in Biology.
Marta Dueñas-Díez+3 more
doaj +1 more source
Biomolecular Interaction Prediction: The Era of AI
This review offers a thorough examination of recent progress in deep learning for predicting biomolecular interactions, including those involving proteins, nucleic acids, and small molecules. It covers data processing strategies, representative model architectures, and evaluation metrics, while highlighting current methodological limitations.
Haoping Wang, Xiangjie Meng, Yang Zhang
wiley +1 more source
Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
A physically universal Turing machine
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. We also provide a variant that is physically universal in the moving tape model, but not in the moving head model.
Ville Salo, Ilkka Törmä
openaire +3 more sources
Uncontrolled Learning: Codesign of Neuromorphic Hardware Topology for Neuromorphic Algorithms
Codesign is used to implement a neuroscience‐inspired machine learning algorithm in all neuromorphic hardware. In this implementation, the hidden memristors cannot be directly accessed, limiting control of the network during training. By leveraging theoretical tools, including memristor circuits dynamics and a closed form expression for the network ...
Frank Barrows+3 more
wiley +1 more source
Random strings and tt-degrees of Turing complete C.E. sets [PDF]
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends ...
Mingzhong Cai+4 more
doaj +1 more source
Multiway Turing machines (also known as nondeterministic Turing machines or NDTMs) with explicit, simple rules are studied. Even very simple rules are found to generate complex behavior, characterized by complex multiway graphs, that can be visualized in multispace that combines "tape" and branchial space.
openaire +2 more sources