Speed-Up Theorems in Type-2 Computation (original) (raw)
Related papers
A new Characterization of Type-2 Feasibility
SIAM Journal on Computing, 1996
Computability in higher types, Pω and the completeness of type assignment
Theoretical Computer Science, 1986
On the expressive power of finitely typed and universally polymorphic recursive procedures
Theoretical Computer Science, 1992
Type-two polynomial-time and restricted lookahead
Theoretical Computer Science
The Speedup Theorem in a Primitive Recursive Framework
Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015
Draft: Time Bounds and The Unit Cost Model for Clocking Type2 Computation
Abstract Some Results in Computational Complexity
2008
Some applications of logic to feasibility in higher types
Arun Sharma, Aleksandar Ignjatovic
ACM Transactions on Computational Logic, 2004
Characterizing complexity classes by higher type primitive recursive definitions
Theoretical Computer Science, 1992
A Characterization of Time Complexity by Simple Loop Programs
Parallel computable higher type functionals
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
On the Expressive Power of Existential Quantification in Polynomial-Time Computability
2000
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures
Theoretical Computer Science, 1992
A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1987
An additivity theorem for plain complexity
2011
Implicit complexity in recursive analysis
Title : Clocking Type-2 Computation in The Unit Cost Model
2006
Bounded queries in recursion theory: a survey
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
2016
On a complexity-based way of constructivizing the recursive functions
Studia Logica, 1990
Type-two Iteration with Bounded Query Revision
Electronic Proceedings in Theoretical Computer Science
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
IFIP International Federation for Information Processing
An arithmetic for non-size-increasing polynomial-time computation
Theoretical Computer Science, 2004
Strong time bounds: Non-computable bounds and a hierarchy theorem
Theoretical Computer Science, 1990
Proceedings of the 27th Annual ACM Symposium on Applied Computing, 2012
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
Theory of Computing Systems, 2009
Computability in higher types and the universal domain Pω
STACS 84, 1984
Complexity of theorem-proving procedures : some general properties
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1974
Combining linear logic and size types for implicit complexity
Theoretical Computer Science, 2019
A note on the density of oracle decreasing time–space complexity
Theoretical Computer Science, 1994
On the system CL12 of computability logic
Logical Methods in Computer Science, 2015
On the Subrecursive Computability of Several Famous Constants
Journal of Universal Computer Science, 2008