2009•Lecture notes in computer scienceRequires access
Small Weakly Universal Turing Machines
Turlough Neary, Damien Woods
Open publisher page 58 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Turlough Neary, Damien Woods
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 58 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Universal Turing machine, Turing machine, Turing machine examples, Time hierarchy theorem, Super-recursive algorithm, Description number, NSPACE, Computer science