Classes of Predictably Computable Functions
From MaRDI portal
Publication:3293402
Cites work
- scientific article; zbMATH DE number 3125697 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- Concatenation as a basis for arithmetic
- Decision Problems of Finite Automata Design and Related Arithmetics
- Theory of Formal Systems. (AM-47)
Cited in
(65)- Jede mit Stackautomaten berechenbare Funktion ist elementar
- scientific article; zbMATH DE number 3574987 (Why is no real title available?)
- Computation models and function algebras
- V-comprehensions and P space
- Functions realizable by one-dimensional iterative systems
- Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar
- \(\mathcal{E}^2\)-computability of \(e\), \(\pi\) and other famous constants
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- On the computability of ordered fields
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Rudimentary relations and primitive recursion: A toolbox
- scientific article; zbMATH DE number 3305096 (Why is no real title available?)
- Two-way automata with more than one storage medium
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage
- Complexity classes and theories of finite models
- The intrinsic difficulty of recursive functions
- A sequence of complexly computable functions
- On computational reducibility
- An algebra and a logic for \(NC^ 1\)
- A note on complexity measures for inductive classes in constructive type theory
- A recursion-theoretic characterisation of the positive polynomial-time functions
- Elementary realizability
- On a complexity-based way of constructivizing the recursive functions
- On maximal subalgebras of the algebras of unary recursive functions
- Relating refined space complexity classes
- Techniques for separating space complexity classes
- On the computational complexity of imperative programming languages
- A universal two-way automaton
- Predecessor machines
- On the generative power of transformational grammars
- Derivational complexity and context-sensitive Rewriting
- Relativization of the Theory of Computational Complexity
- Theories with self-application and computational complexity.
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
- Continuous-time computation with restricted integration capabilities
- The complexity of computing exponents
- Arithmetizing uniform \(NC\)
- Polynomial and abstract subrecursive classes
- Functions definable by arithmetic circuits
- On primitive recursive wordfunctions
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- On the Computational Complexity of Algorithms
- A new recursion-theoretic characterization of the polytime functions
- A New Hierarchy of Elementary Functions
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Algorithmically broad languages for polynomial time and space
- Generalized finite automata theory with an application to a decision problem of second-order logic
- On effectively computable realizations of choice functions
- A recursive and a grammatical characterization of the exponential-time languages
- A method for constructing maximal subalgebras of algebras of general recursive functions
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
- Elementary functions and loop programs
- A generalized Grzegorczyk hierarchy and low complexity classes
- Some observations on the connection between counting and recursion
- Combinatorial principles in elementary number theory
- A maximal sequence of classes transformable by primitive recursion in a given class
- Recursive function theory and numerical analysis
- Complexity of algorithms and computations
- Machine-independent description of certain machine complexity classes
- A machine description and the hierarchy of initial Grzegorczyk classes
- Tape-reversal bounded Turing machine computations
- Nondeterministic stack register machines
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
- On the density of honest subrecursive classes
- Complexity hierarchies beyond elementary
This page was built for publication: Classes of Predictably Computable Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3293402)
