Results 81 to 90 of about 2,083,882 (139)
The wolfram 2,3 turing machine
, 2011 Knowledge about computer scienceThe Wolfram 2,3 Turing machine is the smallest Turing machine known to have the property of computation universality. (The universality was established by the solution of the Wolfram 2,3 Turing machine research prize in ...
Wolfram, Stephen, Nochella, Jesse
core +1 more source
From few‐shot learning to data‐efficient intelligence
AI Magazine, Volume 47, Issue 4, Winter 2026.Abstract Modern artificial intelligence (AI) has achieved remarkable progress by scaling data, model size, and computation. Yet scaling alone does not resolve one of the most fundamental gaps between machine and human intelligence: the ability to learn, adapt, and act from limited experience. This limitation is especially visible when labeled examples,
Yaqing Wang
wiley +1 more source
, 2019 Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: RNDr. Jan Krajíček, DrSc., Department of Algebra Abstract: This thesis is focused on the processes of solving computational problems. The Turing machine is
Bahýľ, Viktor
core
AI Magazine, Volume 47, Issue 4, Winter 2026.Abstract Even while AI based on large language models makes enormous advances, many AI researchers and pundits argue that it LLMs are an inadequate basis for AI because they do not support exact logical and probabilistic reasoning. I argue in response that LLMs can and are using tools to perform such normative reasoning, and thus are in face already ...
Henry Kautz
wiley +1 more source
Dynamic Operations in Macromolecular Data Storage
Angewandte Chemie, Volume 138, Issue 44, 26 October 2026.With the exponential growth of digital data and the limitations of conventional silicon‐based storage and computing technologies, macromolecular data storage, the practice of encoding digital information within large, complex molecules like DNA or synthetic polymers, has emerged as a scalable and sustainable alternative to traditional digital ...
Jakub Ossowski +3 more
wiley +2 more sources
The group of reversible turing machines: subgroups, generators, and computability
Forum of Mathematics, SigmaWe study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state.
Sebastian Barbieri +2 more
doaj +1 more source
Fractal Dimension versus Process Complexity
Advances in Mathematical Physics, 2016 We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machine τ and any particular input x, we consider what we call the space-time diagram which is basically the ...
Joost J. Joosten +2 more
doaj +1 more source
The wolfram 2,3 turing machine
, 2016 Knowledge about computer scienceThe Wolfram 2,3 Turing machine is the smallest Turing machine known to have the property of computation universality. (The universality was established by the solution of the Wolfram 2,3 Turing machine research prize in ...
Wolfram, Stephen, Nochella, Jesse
core +1 more source
Science Needs for a Terrestrial Biosphere Tipping Point Early Warning System
Reviews of Geophysics, Volume 64, Issue 4, December 2026.Abstract Tipping points in the Earth system have the potential to cause major detrimental impacts to the biosphere and societies. Their inherent nonlinearity implies that even relatively small additional increases in external forcing might result in disproportionately large adjustments to components of the Earth system.
Jesse F. Abrams +13 more
wiley +1 more source
Mapping from a Turing machine to a chromatin computer.
, 2012 (A) Turing machine finite state machine with three rules that rewrite the string “xy” to “zz”. (B) The corresponding chromatin computer. The first position in each 3-position nucleosome corresponds to the location of the Turing read/write head.
Barbara Bryant (166998)
core +1 more source