Pages that link to "Item:Q3293402"
From MaRDI portal
The following pages link to Classes of Predictably Computable Functions (Q3293402):
Displayed 50 items.
- The complexity of computing exponents (Q787966) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- A generalized Grzegorczyk hierarchy and low complexity classes (Q1098838) (← links)
- Rudimentary relations and primitive recursion: A toolbox (Q1127532) (← links)
- A method for constructing maximal subalgebras of algebras of general recursive functions (Q1137992) (← links)
- A maximal sequence of classes transformable by primitive recursion in a given class (Q1147129) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662) (← links)
- A machine description and the hierarchy of initial Grzegorczyk classes (Q1168308) (← links)
- Machine-independent description of certain machine complexity classes (Q1168310) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Combinatorial principles in elementary number theory (Q1182430) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Recursive function theory and numerical analysis (Q1216028) (← links)
- On primitive recursive wordfunctions (Q1221752) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- A sequence of complexly computable functions (Q1229680) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- On computational reducibility (Q1232281) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- A recursive and a grammatical characterization of the exponential-time languages (Q1237361) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Elementary realizability (Q1362589) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- Predecessor machines (Q1394128) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- Elementary functions and loop programs (Q1903128) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- On the generative power of transformational grammars (Q2557127) (← links)
- Tape-reversal bounded Turing machine computations (Q2560051) (← links)
- An algebra and a logic for \(NC^ 1\) (Q2638772) (← links)
- Functions Definable by Arithmetic Circuits (Q3576073) (← links)
- Functions realizable by one-dimensional iterative systems (Q3746909) (← links)
- Complexity classes and theories of finite models (Q3942945) (← links)
- Relativization of the Theory of Computational Complexity (Q4124321) (← links)
- Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar (Q4141225) (← links)
- (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)
- 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)