Cristian S. Calude. Simplicity via Provability for Universal Prefix-free Turing Machines. In Turlough Neary, Damien Woods, Anthony Karel Seda, Niall Murphy, editors, Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings. pages 15-22, Cork University Press, 2008.
@inproceedings{Calude08,
title = {Simplicity via Provability for Universal Prefix-free Turing Machines},
author = {Cristian S. Calude},
year = {2008},
researchr = {https://researchr.org/publication/Calude08},
cites = {0},
citedby = {0},
pages = {15-22},
booktitle = {Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings},
editor = {Turlough Neary and Damien Woods and Anthony Karel Seda and Niall Murphy},
publisher = {Cork University Press},
isbn = {978-1-906642-00-6},
}