Searching for "Universality for Turing Machines" – sorted by Relevance.
-
Beyond The Universal Turing Machine
- —that his Universal Turing machine can compute any function that any computer, with any architecture, can
- Cited by 19 (0 self) – Add To MetaCart
-
The complexity of small universal Turing machines
- Four small universal Turing machines Turlough Neary 1 and Damien Woods 2 1 TASS, Department
- Cited by 2 (0 self) – Add To MetaCart
-
A small fast universal Turing machine
- A small fast universal Turing machine Turlough Neary 1 and Damien Woods 2 1 Theoretical Aspects
- Cited by 9 (6 self) – Add To MetaCart
-
Remarks on the computational complexity of small universal Turing machines
- Remarks on the computational complexity of small universal Turing machines Damien Woods ∗ School
- Cited by 1 (1 self) – Add To MetaCart
-
IOS Press Four Small Universal Turing Machines
- Universal Turing Machines Turlough Neary∗† Boole Centre for Research in Informatics, University College Cork
- Add To MetaCart
-
Small semi-weakly universal Turing machines
- Small semi-weakly universal Turing machines Damien Woods 1 and Turlough Neary 2 1 Department
- Cited by 3 (2 self) – Add To MetaCart
-
On the time complexity of 2-tag systems and small universal turing machines
- On the time complexity of 2-tag systems and small universal Turing machines ∗ Damien Woods Boole
- Cited by 5 (3 self) – Add To MetaCart
-
Super Turing-Machines
- B. Jack Copeland 1 1. Universal Turing Machines A universal Turing machine is an idealised computing
- Cited by 5 (1 self) – Add To MetaCart
-
Prefix-free Turing Machines
- CDMTCS Research Report Series Simplicity via Provability for Universal Prefix-free Turing Machines
- Add To MetaCart
-
Very simple Chaitin machines for concrete AIT
- celebrated Omega number, the halting probability of a universal Chaitin machine, a universal Turing machine
- Cited by 2 (1 self) – Add To MetaCart

