"The complexity of small universal Turing machines: A survey."

Damien Woods, Turlough Neary (2009)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2008.09.051

access: open

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/WoodsN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/WoodsN09
Damien Woods, Turlough Neary:
The complexity of small universal Turing machines: A survey. Theor. Comput. Sci. 410(4-5): 443-450 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.