Pages that link to "Item:Q3293402"
From MaRDI portal
The following pages link to Classes of Predictably Computable Functions (Q3293402):
Displayed 7 items.
- A universal two-way automaton (Q5559258) (← links)
- A New Hierarchy of Elementary Functions (Q5570927) (← links)
- (Q5586400) (← links)
- Generalized finite automata theory with an application to a decision problem of second-order logic (Q5592253) (← links)
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881) (← links)
- Jede mit Stackautomaten berechenbare Funktion ist elementar (Q5668457) (← links)
- Computation models and function algebras (Q6064278) (← links)