External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Simplicity via Provability for Universal Prefix-free Turing Machines

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.

Abstract

Abstract is missing.

runs on