The following pages link to Computation as an unbounded process (Q418791):
Displaying 5 items.
- P colonies. Survey (Q2299890) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)
- A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems (Q2945877) (← links)
- Extended spiking neural P systems with white hole rules and their red-green variants (Q6061996) (← links)
- Variants of P systems with activation and blocking of rules (Q6150991) (← links)
