Skip to content

Opening book details…

About this Computer Science article

On the Use of Inaccessible Numbers and Order Indiscernibles in Lower Bound Arguments for Random Access Machines by Wolfgang Maass is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Wolfgang Maass
Publisher
Association for Symbolic Logic; Cambridge University Press; Cambridge University Press (CUP) (ISSN 0022-4812)
Published
1988
Language
EN
Field
Computer Science (Physical Sciences)

More by Wolfgang Maass

Browse all works by Wolfgang Maass