Results 11 to 20 of about 17,878 (214)

The universe as quantum computer [PDF]

, 2012
This article reviews the history of digital computation, and investigates just how far the concept of computation can be taken. In particular, I address the question of whether the universe itself is in fact a giant computer, and if so, just what kind of
Lloyd, Seth
core   +2 more sources

On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures [PDF]

, 2006
We study the notion of limit sets of cellular automata associated with probability measures (mu-limit sets). This notion was introduced by P. Kurka and A. Maass. It is a refinement of the classical notion of omega-limit sets dealing with the typical long
J. Kari, J. Kari, K. Nagel, K. Čulik II, P. Kůrka, P. Kůrka, S. Wolfram   +6 more
core   +6 more sources

Self-verifying cellular automata [PDF]

, 2018
We study the computational capacity of self-verifying cellular automata with an emphasis on one-way information flow (SVOCA). A self-verifying device is a nondeterministic device whose nondeterminism is symmetric in the following sense.
A Malcher, AR Smith III, C Choffrut, CR Dyer, G Jirásková, H Umeo, J Hromkovic, J Hromkovic, M Kutrib, M Kutrib, OH Ibarra, P Duriš, PC Fischer, S Ginsburg, T Buchholz, T Buchholz, W Bucher   +16 more
core   +1 more source

Intrinsic universality and the computational power of self-assembly

, 2013
This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.
Woods, Damien
core   +2 more sources

Self-Replicating Machines in Continuous Space with Virtual Physics [PDF]

, 2003
JohnnyVon is an implementation of self-replicating machines in continuous two-dimensional space. Two types of particles drift about in a virtual liquid.
Arnold Smith, Peter Turney, Peter Turney (corresponding, Robert Ewaschuk   +3 more
core   +4 more sources

On the Parity Problem in One-Dimensional Cellular Automata [PDF]

, 2012
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s.
Angluin, Angluin, Chaudhuri, de Oliveira, Enrico Formenti, Fatès, Fuk\'s, Haykin, Heater Betel, Hopcroft, Lee, Lenzen, Martins, Paola Flocchini, Pedro P. B. de Oliveira, Peleg, Sipper, Voorhees, Wolz   +18 more
core   +2 more sources

Computational Aspects of Asynchronous CA [PDF]

, 2011
This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines.
Chandesris, Jérôme, Dennunzio, Alberto, Formenti, Enrico, Manzoni, Luca   +3 more
core  

Intrinsically Universal Cellular Automata

, 2009
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing ...
Ollinger, Nicolas
core   +3 more sources

Complex Systems: A Survey [PDF]

, 2011
A complex system is a system composed of many interacting parts, often called agents, which displays collective behavior that does not follow trivially from the behaviors of the individual parts.
Newman, M. E. J.
core   +4 more sources

Data‐driven forecasting of ship motions in waves using machine learning and dynamic mode decomposition

International Journal of Adaptive Control and Signal Processing, EarlyView.
Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez, Mauro Gaggero, Andrea Serani   +2 more
wiley   +1 more source