Results 121 to 130 of about 2,596,832 (272)
Declaring independence from medium independence
Computation is widely assumed to be necessarily medium independent, meaning that it is not defined in terms of any physical properties, but only by abstract automata (or something similar). I argue for two things. First, computation is not necessarily medium independent, because characterizing analog computation requires reference to physical ...
Corey J. Maley
wiley +1 more source
A Bayesian meta‐learning framework is proposed for reaction outcome prediction in low‐data settings. It utilizes a literature‐mined dataset on asymmetric hydrogenation of olefins to build a pre‐trained model. This meta‐model is shown to return better predictions as compared to single‐tasks methods, such as random forest and graph neural networks, given
Sukriti Singh+1 more
wiley +2 more sources
A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines [PDF]
We construct a 1-tape 98-state 10-symbol universal reversible Turing machine (URTM(98,10)) that directly simulates reversible counter machines (RCMs). The objective of this construction is not to minimize the numbers of states and tape symbols, but
Kenichi Morita
doaj +1 more source
Against the Manhattan project framing of AI alignment
In response to the worry that autonomous generally intelligent artificial agents may at some point take over control of human affairs a common suggestion is that we should “solve the alignment problem” for such agents. We show that current discourse around this suggestion often uses a particular framing of artificial intelligence (AI) alignment as ...
Simon Friederich, Leonard Dung
wiley +1 more source
Evolution of petal patterning: blooming floral diversity at the microscale
Summary The flowers of angiosperms are extraordinarily diverse. While most floral variation is visible to the naked eye, this diversity goes beyond the macroscale: Floral organs comprise an underappreciated range of cell types that generate a multitude of patterns across their surfaces and give rise to novel structures.
Erin Doody, Edwige Moyroud
wiley +1 more source
A Review on Neural Turing Machine (NTM)
Soroor Malekmohamadi Faradonbe+2 more
semanticscholar +1 more source
Flow diagrams, turing machines and languages with only two formation rules [PDF]
Corrado Böhm, G. Jacopini
openalex +1 more source
ω-Computations on Turing machines
AbstractThe paper develops the theory of Turing machines as recognizers of infinite (ω-type) input tapes. Various models of ω-type Turing acceptors are considered, varying mainly in their mechanism for recognizing ω-tapes. A comparative study of the models is made.
Rina S. Cohen, Arie Y. Gold
openaire +1 more source
Two-Tape Simulation of Multitape Turing Machines [PDF]
F. C. Hennie, Richard E. Stearns
openalex +1 more source
Turing Machine and Automata Simulators [PDF]
AbstractThis paper introduces a Turing machine and pushdown automata simulators as a virtual environment for learning computational models and automata theory. The twofold contribution of this work is a novel use of modern technology to improve learning and a longitudinal experimental evaluation of its use in context. A preliminary evaluation shows the
openaire +1 more source