Skip to content
#

cutstrings

Star

Here are 2 public repositories matching this topic...

inaciovasquez2020 / overlap-rigidity-counterexamples

Star 1

Unified Capacity–Locality Problem (UCLP): a formal decision framework for bounded locality, information capacity, and progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE criteria.

information-theory locality benchmarks theoretical-computer-science computational-complexity complexity-theory foundations-of-computation unified-rigidity-framework entropy-depth capacity-locality urf-admissible cutstrings
  • Updated Mar 19, 2026
  • Python

inaciovasquez2020 / overlap-rigidity-lean

Star 1

Unified Capacity–Locality Problem (UCLP): a decision framework for bounded locality, bounded information injection, and valid progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE predicate.

information-theory locality benchmarks computational-complexity complexity-theory foundations-of-computation unified-rigidity-framework entropy-depth capacity-locality urf-admissible cutstrings
  • Updated Mar 19, 2026
  • Python

Improve this page

Add a description, image, and links to the cutstrings topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the cutstrings topic, visit your repo's landing page and select "manage topics."

Learn more