The following pages link to Teijiro Isokawa (Q856415):
Displayed 25 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)
- On cellular automata rules of molecular arrays (Q2629945) (← 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)
- Computing by Swarm Networks (Q3541742) (← links)
- Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata (Q3541765) (← links)
- (Q3568117) (← links)
- FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA (Q4669689) (← links)
- Self-Timed Cellular Automata and their computational ability (Q4788329) (← links)
- Molecular Implementations of Cellular Automata (Q4931276) (← links)
- (Q5039218) (← links)
- Invertible Construction of Decimal-to-Binary Converter Using Reversible Elements (Q5112168) (← links)
- Computation and Pattern Formation by Swarm Networks with Brownian Motion (Q5112171) (← links)
- (Q5315805) (← links)
- Universal Computation in a Simplified Brownian Cellular Automaton with von Neumann Neighborhood (Q5377334) (← links)
- Universal Construction on Self-Timed Cellular Automata (Q5464091) (← 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)