Pages that link to "Item:Q3293402"
From MaRDI portal
The following pages link to Classes of Predictably Computable Functions (Q3293402):
Displaying 14 items.
- (Q4144800) (← links)
- <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants (Q4918028) (← links)
- V-comprehensions and P space (Q5057477) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- On the Computational Complexity of Algorithms (Q5339741) (← links)
- Generalized finite automata theory with an application to a decision problem of second-order logic (Q5538923) (← links)
- 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)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\) (Q6560166) (← links)
- On the computability of ordered fields (Q6587462) (← links)
