Polynomial and abstract subrecursive classes
From MaRDI portal
Cites work
- A Classification of the Recursive Functions
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Admissible ordinals and intrinsic consistency
- Algebraically Generalized Recursive Function Theory
- An Overview of the Theory of Computational Complexity
- Augmented loop languages and classes of computable functions
- Classes of computable functions defined by bounds on computation
- Classes of Predictably Computable Functions
- Degrees of Unsolvability. (AM-55)
- Extension of an effectively generated class of functions by enumeration
- Gödel numberings of partial recursive functions
- Helping and the meet of pairs of honest subrecursive classes
- scientific article; zbMATH DE number 3735149 (Why is no real title available?)
- scientific article; zbMATH DE number 3480091 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3557270 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3446413 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3355016 (Why is no real title available?)
- scientific article; zbMATH DE number 3092188 (Why is no real title available?)
- Minimal pairs of polynomial degrees with subexponential complexity
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- On the Computational Complexity of Algorithms
- On the density of honest subrecursive classes
- On the Structure of Polynomial Time Reducibility
- Recursively enumerable sets of positive integers and their decision problems
- Space-bounded reducibility among combinatorial problems
- Subrecursive Programming Languages, Part I
- The honest subrecursive classes are a lattice
Cited in
(39)- Indexings of subrecursive classes
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
- Nondiamond theorems for polynomial time reducibility
- Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
- A note on complexity measures for inductive classes in constructive type theory
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
- A tight relationship between generic oracles and type-2 complexity theory
- Gap-languages and log-time complexity classes
- Theories with self-application and computational complexity.
- Structural properties of bounded relations with an application to NP optimization problems
- Uniformly hard languages.
- Quantitative coding and complexity theory of compact metric spaces
- Parametrised second-order complexity theory with applications to the study of interval computation
- Game semantics approach to higher-order complexity
- Feasible functionals and intersection of ramified types
- Axiomatizing resource bounds for measure
- Feasible Iteration of Feasible Learning Functionals
- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge
- Structural properties for feasibly computable classes of type two
- Exact Pairs for Abstract Bounded Reducibilities
- Computable analysis and notions of continuity in \textsc{Coq}
- Primitive recursive equivalence relations and their primitive recursive complexity
- A tier-based typed programming language characterizing feasible functionals
- The theory of the polynomial many-one degrees of recursive sets is undecidable
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Foundations of online structure theory. II: The operator approach
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Quantitative continuity and Computable Analysis in Coq
- Computation models and function algebras
- Expressing computational complexity in constructive type theory
- Complete and tractable machine-independent characterizations of second-order polytime
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- On basic feasible functionals and the interpretation method
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- Complete and tractable machine-independent characterizations of second-order polytime
- A proof-theoretic characterization of the basic feasible functionals
- Resource restricted computability theoretic learning: Illustrative topics and problems
- The basic feasible functionals in computable analysis
This page was built for publication: Polynomial and abstract subrecursive classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1227276)
