Infinite Computations and a Hierarchy in Δ3

Authors:
Branislav Rovan;L'Uboš Steskal
Affiliations:
Department of Computer Science, Faculty of Mathematics Physics and Informatics, Comenius University, 84248 Bratislava, Slovakia;Department of Computer Science, Faculty of Mathematics Physics and Informatics, Comenius University, 84248 Bratislava, Slovakia
Venue:
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Year:
2007

Citing 1
Cited 1

On the computational power of neural nets

Journal of Computer and System Sciences

Computation as an unbounded process

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a hierarchy of families between the Σ2and Δ3levels of the arithmetic hierarchy. The structure of the top five levels of this hierarchy is in some sense similar to the structure of the Chomsky hierarchy, while the bottom levels are reminiscent of the bounded oracle query hierarchy.