scientific article; zbMATH DE number 1980917
From MaRDI portal
Publication:4428291
zbMath1023.03033MaRDI QIDQ4428291
Publication date: 15 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2514/25140053.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bounded arithmeticdynamic ordinalsweak implicit computational complexitywitness oracle Turing machines
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15) Turing machines and related notions (03D10)
This page was built for publication: