The counting hierarchy in binary notation (Q1008842): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:52, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The counting hierarchy in binary notation |
scientific article |
Statements
The counting hierarchy in binary notation (English)
0 references
30 March 2009
0 references
Summary: We present a new recursion-theoretic characterization of FCH, the hierarchy of counting functions, in binary notation. Afterwards we introduce a theory of bounded arithmetic, TCA, that can be seen as a reformulation, in the binary setting, of Jan Johannsen and Chris Pollett's system \(D^{0}_{2}\). Using the previous inductive characterization of FCH, we show that a strategy similar to the one applied to \(D^{0}_{2}\) can be used in order to characterize FCH as the class of functions provably total in TCA.
0 references
counting hierarchy
0 references
bounded arithmetic
0 references
complexity theory
0 references