default search action
"Simplicity via provability for universal prefix-free Turing machines."
Cristian S. Calude (2011)
- Cristian S. Calude:
Simplicity via provability for universal prefix-free Turing machines. Theor. Comput. Sci. 412(1-2): 178-182 (2011)
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.