The following pages link to Ferdinand Peper (Q856416):
Displaying 41 items.
- Construction universality in purely asynchronous cellular automata (Q856418) (← links)
- Asynchronous self-reproducing loops with arbitration capability (Q875458) (← links)
- Defect-tolerance in cellular nanocomputers (Q877463) (← links)
- A defect localization scheme for cellular nanocomputers (Q1031922) (← links)
- (Q1108032) (redirect page) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Characterization of random fluctuation-based computation in cellular automata (Q1615680) (← links)
- Delay-insensitive computation in asynchronous cellular automata (Q1776377) (← links)
- Computation by asynchronously updating cellular automata (Q1777751) (← links)
- Asynchronous game of life (Q1888139) (← links)
- Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata (Q2077812) (← links)
- Self-adaptive self-reproductions in cellular automata (Q2448434) (← links)
- On cellular automata rules of molecular arrays (Q2629945) (← links)
- (Q2707536) (← links)
- Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA (Q2819160) (← links)
- On DNA-Based Gellular Automata (Q2945537) (← links)
- Online Marking of Defective Cells by Random Flies (Q3540014) (← links)
- Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata (Q3541739) (← links)
- Computing by Swarm Networks (Q3541742) (← links)
- An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements (Q3541745) (← links)
- Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata (Q3541765) (← links)
- (Q3568117) (← links)
- (Q4437100) (← links)
- Universal delay-insensitive systems with buffering lines (Q4590359) (← links)
- FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA (Q4669689) (← links)
- Self-Timed Cellular Automata and their computational ability (Q4788329) (← links)
- (Q4825679) (← links)
- INSTANTANEOUS, NON-SQUEEZED, NOISE-BASED LOGIC (Q4911788) (← links)
- Efficient Circuit Construction in Brownian Cellular Automata Based on a New Building-Block for Delay-Insensitive Circuits (Q4931230) (← links)
- Molecular Implementations of Cellular Automata (Q4931276) (← links)
- Computation and Pattern Formation by Swarm Networks with Brownian Motion (Q5112171) (← links)
- On Non-polar Token-Pass Brownian Circuits (Q5112177) (← links)
- (Q5315805) (← links)
- Universality of Hexagonal Asynchronous Totalistic Cellular Automata (Q5464066) (← links)
- Universal Construction on Self-Timed Cellular Automata (Q5464091) (← links)
- Synchronization of Protein Motors Modeled by Asynchronous Cellular Automata (Q5464135) (← links)
- UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA (Q5481851) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5915878) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5918964) (← links)
- A universal Brownian cellular automaton with 3 states and 2 rules (Q6084235) (← links)
- Universal logic elements constructed on the Turing tumble (Q6151192) (← links)
