The following pages link to (Q4473975):
Displayed 10 items.
- Reactive Turing machines (Q393091) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Autopoietic automata: complexity issues in offspring-producing evolving processes (Q2383596) (← links)
- Question answering by humans and machines: a complexity-theoretic view (Q2422044) (← links)
- Towards “Fypercomputations” (in Membrane Computing) (Q3166953) (← links)
- On the Executability of Interactive Computation (Q3188271) (← links)
- How We Think of Computing Today (Q3507474) (← links)