The following pages link to (Q5824357):
Displayed 50 items.
- On the representation of partial recursive functions as superpositions (Q759130) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- A note on discreteness and virtuality in analog computing (Q870262) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Existence of infinite bases with respect to superposition in certain classes of one-place functions (Q920082) (← 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)
- Classification of computably approximable real numbers (Q1015380) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Super-exponentials nonprimitive recursive, but rudimentary (Q1095134) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- A generalized Grzegorczyk hierarchy and low complexity classes (Q1098838) (← links)
- Existence of superposition bases in countable primitively recursively closed classes (Q1098839) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- Rudimentary relations and primitive recursion: A toolbox (Q1127532) (← links)
- A method for constructing maximal subalgebras of algebras of general recursive functions (Q1137992) (← links)
- How to prove that two classes of simple primitive recursive functions are distinct (Q1147128) (← links)
- A maximal sequence of classes transformable by primitive recursion in a given class (Q1147129) (← links)
- Hierarchies of operators in constructive metric spaces (Q1147142) (← links)
- Equational calculi for Grzegorczyk's classes \(\mathcal E^n\) (Q1148314) (← links)
- A superposition basis in the class of Kalmar elementary functions (Q1163014) (← links)
- Positive rudimentarity of the graphs of Ackermann and Grzegorczyk (Q1168313) (← links)
- Combinatorial principles in elementary number theory (Q1182430) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Elementary Skolem functions (Q1221750) (← links)
- On primitive recursive wordfunctions (Q1221752) (← links)
- Representation of partial recursive functions with certain conditions in the form of superpositions (Q1222648) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- On computational reducibility (Q1232281) (← links)
- A recursive and a grammatical characterization of the exponential-time languages (Q1237361) (← links)
- Recognition of invariant properties of algorithms (Q1245949) (← links)
- Properties of graphs of functions in the Grzegorczyk hierarchy (Q1245953) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- A simple syntactic definition of all classes of the Grzegorczyk hierarchy (Q1256451) (← links)
- A specification of parallel problems (Q1257334) (← links)
- The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
- An inherently iterative algorithm for the Grzegorczyk hierarchy (Q1318699) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Grzegorczyk's hierarchy of computable analysis (Q1575655) (← links)
- The Church-Rosser theorem and quantitative analysis of witnesses (Q1627965) (← links)
- Bounded prefix concatenation operation and finite bases with respect to the superposition (Q1744291) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- A formal system of reduction paths for parallel reduction (Q1989338) (← links)
- Bounded monotone recursion and multihead automata (Q2017762) (← links)