OAI/MathematicalPhysics/NavierStokes/ForcedComputation/Programs/TuringInputEncoding.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

The input word of Mathlib's fixed interpreter is primitive recursive. No computability claim about varying the machine table is needed.

  1. theorem OAI.ForcedComputation.FiniteMachine.trNat_pos line 13
  2. theorem OAI.ForcedComputation.FiniteMachine.trNat_rec line 18
  3. def OAI.ForcedComputation.FiniteMachine.nextBits line 48
  4. theorem OAI.ForcedComputation.FiniteMachine.nextBits_primrec line 53
  5. theorem OAI.ForcedComputation.FiniteMachine.trNat_primrec line 67
  6. theorem OAI.ForcedComputation.FiniteMachine.trList_primrec line 82
  7. theorem OAI.ForcedComputation.FiniteMachine.trInit_primrec line 91