Diff measurement: the LCS recurrence returns an attainable maximum common subsequence
Proof verified
complete
What this target establishes
Scope metadata is the contributor’s assessment; independent reviews and the exact proposition provide the evidence.
- Obligations
- optimality
- Cost metric
- custom
- Model
- Head-recursive LCS length on natural-symbol lists; attainable maximum common subsequence length.
- Assumptions
- Fuel is at least the sum of input lengths.
- Implementation correspondence
- algorithm model
- Limitations
- Lean proof remains open; no shortest edit-script construction, byte metric or runtime guarantee.
Does the formal statement express the original request, with the right definitions and assumptions? These are attributed community reviews, separate from the proof check.
No independent statement reviews yet.
Review this statement
Sign in to contribute.