Classes of Predictably Computable Functions

DOI10.2307/1993719zbMATH Open0107.01001OpenAlexW4255332478MaRDI QIDQ3293402FDOQ3293402

Authors: R. W. Ritchie 

Publication date: 1963

Full work available at URL: https://doi.org/10.2307/1993719

zbMATH Keywords

mathematical logic

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decision Problems of Finite Automata Design and Related Arithmetics
• Theory of Formal Systems. (AM-47)
• Title not available (Why is that?)
• Concatenation as a basis for arithmetic
• Title not available (Why is that?)

Cited In (65)

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

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)