Back to results
University of Illinois at Urbana-Champaign
Computational complexity of random-access models
Abstract
dc:descriptionThe relative power of several computational models is considered. These models are the Turing machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic computational properties of the pointer machine are examined in more detail. For example, time and space hierarchy theorems for pointer machines are presented.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Luginbuhl, David Ralph
- Contributors dc:contributor
-
- Loui, Michael C.
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- Copyright 1990 Luginbuhl, David Ralph
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
AAI9026259
(UMI)AAI9026259 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/22763