"Simplicity via Provability for Universal Prefix-free Turing Machines"

Cristian S. Calude (2008)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-0906-3235
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0906-3235
Cristian S. Calude:
Simplicity via Provability for Universal Prefix-free Turing Machines. CSP 2008: 16-21

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.