We prove that any Chaitin Ω number (i.e., the halting probability of a universal self-delimiting Turing machine) is wtt-complete, but not tt-complete.Expand

The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistent… Expand

1. Prerequisites 1.1. Preliminary Notions and Notations 1.2. Operations on Strings and Languages 1.3. A General Computing Framework 1.4. Chomsky Grammars 1.5. Lindenmayer Systems 1.6. Automata and… Expand