A Note on Universal Measures for Weak Implicit Computational Complexity

Authors:
Arnold Beckmann
Affiliations:
-
Venue:
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2002

Citing 4
Cited 0

Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
Termination Proofs and Complexity Certification

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note is a case study for finding universal measures for weak implicit computational complexity. We will instantiate "universal measures" by "dynamic ordinals", and "weak implicit computational complexity" by "bounded arithmetic". Concretely, we will describe the connection between dynamic ordinals and witness oracle TURING machines for bounded arithmetic theories.