Skip to content

Formalize open problems and polynomial complexity - #35

Draft
hhh1234-ggg wants to merge 1 commit into
gametheoryinlean:mainfrom
hhh1234-ggg:feature/open-problem-complexity-formalization
Draft

Formalize open problems and polynomial complexity#35
hhh1234-ggg wants to merge 1 commit into
gametheoryinlean:mainfrom
hhh1234-ggg:feature/open-problem-complexity-formalization

Conversation

@hhh1234-ggg

Copy link
Copy Markdown

Summary

  • formalize the 24 EconCS open-problem statements more precisely;
  • add a shared unit-cost RAM framework for polynomial time, space, randomness, and oracle-query bounds;
  • add structural encodings and strict execution certificates;
  • add regression examples for common growth rates and RAM programs.

Verification

  • all 24 Problem.lean files pass Lean checking
  • python3 scripts/check_lean_placeholders.py EconCSLib passes
  • unit-cost RAM regression examples pass
  • git diff --check passes

Notes

3_ problem I think needs some change.

@hhh1234-ggg
hhh1234-ggg marked this pull request as draft August 18, 2026 15:28
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant