OAI/Combinatorics/EditApproximation/Binary/BinaryBellmanReads.lean

GitHub source file

5 declarations, 0 contain sorry, 0 declared as axioms

Bellman action evaluation with literal finite-table reader calls. Child words are gathered once, then Boolean arithmetic operates on that stored list. Reader scans are part of the returned cost.

  1. theorem OAI.EditApproximation.BinaryFraction.bellmanActionReadWithWork_eq line 17
  2. theorem OAI.EditApproximation.BinaryFraction.bellmanActionReadWithWork_cost line 26
  3. theorem OAI.EditApproximation.BinaryFraction.bellmanReadWithWork_eq line 42
  4. theorem OAI.EditApproximation.BinaryFraction.bellmanReadWithWork_cost line 51
  5. theorem OAI.EditApproximation.BinaryFraction.bellmanWithWork_action_count line 73