{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/22763"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/22763","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Computational complexity of random-access models","abstract":"The 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.","abstract_html":"The 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.","abstract_has_math":false,"creators":["Luginbuhl, David Ralph"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Loui, Michael C."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:50:41Z","date_published":"2011-05-07T13:50:41Z","updated_at":"2026-07-22T22:25:20Z","subjects":["Mathematics","Computer Science"],"languages":["eng"],"rights":["Copyright 1990 Luginbuhl, David Ralph"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9026259","(UMI)AAI9026259"],"render_values":[{"text":"AAI9026259","href":null,"code":true},{"text":"(UMI)AAI9026259","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/22763","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Loui, Michael C."]},{"key":"dc:creator","label":"Author","values":["Luginbuhl, David Ralph"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:50:41Z","10000-01-01","1990"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1990 Luginbuhl, David Ralph"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9026259","(UMI)AAI9026259","http://hdl.handle.net/2142/22763"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The 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.","Every Turing machine of time complexity $t$ and space complexity $s$ can be simulated by a pointer machine of time complexity $O$($t$) using $O$($s$/log $s$) nodes. This strengthens a similar result by van Emde Boas (1989). Every alternating pointer machine of time complexity $t$ can be simulated by a deterministic pointer machine using $O$($t$/log $t$) nodes. Other results concerning nondeterministic and alternating pointer machines are presented.","Every tree machine of time complexity $t$ can be simulated on-line by a log-cost RAM of time complexity $O$(($t$log $t$)/log log $t$). This simulation is shown to be optimal using the notion of incompressibility from Kolmogorov complexity (Solomonoff, 1964; Kolmogorov, 1965).","Every $d$-dimensional Turing machine of time complexity $t$ can be simulated on-line by a log-cost RAM running in time $O$($t$(log $t$)$\\sp{1-(1/d)}$)(log log $t$)$\\sp{(1/d}$). There is a log-cost RAM $R$ running in time $t$ such that every $d$-dimensional Turing machine requires time $\\Omega$($t\\sp{1+(1/d)}$/(log $t$(log log $t$)$\\sp{1+(1/d)}$)) to simulate $R$ on-line. Every unit-cost RAM of time complexity $t$ can be simulated on-line by a $d$-dimensional Turing machine in time $O$($t$($n$)$\\sp2$log $t$($n$)).","Made available in DSpace on 2011-05-07T13:50:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9026259.pdf: 3294983 bytes, checksum: 09e2fa4d15fc66aa6b9f836a03bc9fc8 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:59:50Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:28:16-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Computational complexity of random-access models"]}]}],"canonical_facts":{"dc:contributor":["Loui, Michael C."],"dc:creator":["Luginbuhl, David Ralph"],"dc:date":["2011-05-07T13:50:41Z","10000-01-01","1990"],"dc:description":["The 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.","Every Turing machine of time complexity $t$ and space complexity $s$ can be simulated by a pointer machine of time complexity $O$($t$) using $O$($s$/log $s$) nodes. This strengthens a similar result by van Emde Boas (1989). Every alternating pointer machine of time complexity $t$ can be simulated by a deterministic pointer machine using $O$($t$/log $t$) nodes. Other results concerning nondeterministic and alternating pointer machines are presented.","Every tree machine of time complexity $t$ can be simulated on-line by a log-cost RAM of time complexity $O$(($t$log $t$)/log log $t$). This simulation is shown to be optimal using the notion of incompressibility from Kolmogorov complexity (Solomonoff, 1964; Kolmogorov, 1965).","Every $d$-dimensional Turing machine of time complexity $t$ can be simulated on-line by a log-cost RAM running in time $O$($t$(log $t$)$\\sp{1-(1/d)}$)(log log $t$)$\\sp{(1/d}$). There is a log-cost RAM $R$ running in time $t$ such that every $d$-dimensional Turing machine requires time $\\Omega$($t\\sp{1+(1/d)}$/(log $t$(log log $t$)$\\sp{1+(1/d)}$)) to simulate $R$ on-line. Every unit-cost RAM of time complexity $t$ can be simulated on-line by a $d$-dimensional Turing machine in time $O$($t$($n$)$\\sp2$log $t$($n$)).","Made available in DSpace on 2011-05-07T13:50:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9026259.pdf: 3294983 bytes, checksum: 09e2fa4d15fc66aa6b9f836a03bc9fc8 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:59:50Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:28:16-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9026259","(UMI)AAI9026259","http://hdl.handle.net/2142/22763"],"dc:language":["eng"],"dc:rights":["Copyright 1990 Luginbuhl, David Ralph"],"dc:subject":["Mathematics","Computer Science"],"dc:title":["Computational complexity of random-access models"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:20Z"}