Titlebook: Collision-Based Computing; Andrew Adamatzky Book 2002 Springer-Verlag London 2002 Advanced Computer Architectures.Cellular Automata.Collis

children

書(shū)目名稱(chēng)Collision-Based Computing影響因子(影響力)




書(shū)目名稱(chēng)Collision-Based Computing影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Collision-Based Computing網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Collision-Based Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Collision-Based Computing被引頻次




書(shū)目名稱(chēng)Collision-Based Computing被引頻次學(xué)科排名




書(shū)目名稱(chēng)Collision-Based Computing年度引用




書(shū)目名稱(chēng)Collision-Based Computing年度引用學(xué)科排名




書(shū)目名稱(chēng)Collision-Based Computing讀者反饋




書(shū)目名稱(chēng)Collision-Based Computing讀者反饋學(xué)科排名

Overstate

鳴叫

Conservative Logicibility of the dynamical laws and the conservation of certain additive quantities (among which energy plays a distinguished role). Because it more closely mirrors physics than traditional models of computation, conservative logic is in a better position to provide indications concerning the realizat

脾氣暴躁的人

Computing Inside the Billiard Ball Modelrst we introduce block cellular automata and consider the automata reversibility and simulation dependencies between the block cellular automata and classical cellular automata. We prove that there exists a universal, i.e. simulating any Turing machine, block cellular automaton with eleven states, w

Acetaldehyde

Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spacesn physics. We show that, despite strict constraints of reversibility and number-conservation, there exist simple two-dimensional NC-RCAs that are capable of universal computation. These automata are classified into two types. Automaton of the first type implements a Fredkin gate in its space-time dy

毀壞

毀壞

Signals on Cellular Automata be possible to give a general definition of a signal, we choose, in this chapter, to think about signals as trajectories of information quanta. Various cellular automata that support propagation of the signals are discussed in the text. We develop a cellular automaton algorithm which implements tra

半球

Computing with Solitons: A Review and Prospectusrmation transfer in collisions of optical solitons, to state transformations in collisions of vector soli-tons. We conclude by discussing open problems and the prospects for practical applications using optical solitons in photo-refractive crystals and other materials.

MAG

Gated Logic with Optical Solitonsbrief historical perspective on optical soliton logic gate studies. Our own work is then reviewed which concentrates on gated logic with spatial soliton collisions in non-integrable systems. Logic inverting transfer functions are shown, which demonstrate cascadability, fan-out, wide noise margins, a

EWE

Finding Gliders in Cellular Automatathod is described for automatically classifying cellular automata rules for a spectrum of ordered, complex and chaotic dynamics, and thus identify rules that support interacting gliders. This is achieved by a measure of the variance of input-entropy over time. The distribution of rule classes in rul