Individual skill

stoc-experiments

Use when judging whether computation belongs in a STOC (ACM Symposium on Theory of Computing) paper at all — STOC accepts on theorems, with no empirical-evaluation expectation — and when it does, scoping it as certified proof computation, constructive search, or clearly labeled illustration rather than benchmarking.

STOC-Skills/skills/stoc-experiments/SKILL.md

Read pinned source

Source commit 932eb23331721b16e967c59f093781be1928b498

What was checked

Matches the observed repository HEAD
Yes
Scanner rules are current
Yes
Repository scan complete
No
Skill scan complete
No
Observed behavior
Network or broad shell
Last checked
Nov 9, 2026

These are observations at the recorded commit, not a guarantee of safety. Review the source before running it.

Install this skill

Choose an agent in your Stack or copy a command below. Commands fetch the pinned commit and copy only this skill directory. Existing destinations are refused. Copying a command does not install anything.

An install command is unavailable: current rules, complete repository and skill scans, an eligible behavior level and a permitted license are required.

Repository context

Repository stars (not skill ratings)
1,405
Repository last updated
Sep 27, 2026
License
MIT

Observed agent integration: No specific integration evidence. Standard SKILL.md installation does not imply verified compatibility.

Files and excerpt

File metadata and permitted, redacted excerpts come from the recorded scan. Source links are pinned to that commit.

Browse files
Read excerpt

# STOC Experiments

The ground truth about this venue: STOC papers are accepted on the strength of
theorems, and the STOC 2026 Call for Papers asks for original research on the
theory of computation with no empirical-evaluation requirement of any kind
(checked 2026-07-08). Most STOC papers contain zero computation. The question
this skill answers is not "how do I run experiments for STOC" but "does this
computation have a legitimate job in a STOC paper, and if so, which job?"

## The three legitimate jobs of computation

| Job | Example | Proof weight | Obligations |
|---|---|---|---|
| Proof step | Exhaustive check of base cases $n \le 8$; SAT-certified nonexistence of a small counterexample | Full — the theorem is false if the run is wrong | Determinism, published certificate, independent checker (see `stoc-reproducibility`) |
Back to top