The following pages link to (Q4417859):
Displaying 12 items.
- Simulation of simultaneous safe recursion over an arbitrary structure (Q845681) (← links)
- Multiple permitting and array noncomputability (Q1670715) (← links)
- Causal computational complexity of distributed processes (Q2112798) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- A hypercomputational alien (Q2497874) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Primitive recursion in the abstract (Q5220181) (← links)
- There is no safe pairing function over an arbitrary structure (Q5485489) (← links)
