The following pages link to Computation as an unbounded process (Q418791):
Displayed 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)
- Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines (Q5158665) (← links)
- TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS (Q5741615) (← links)