Computer Science
Engineering is kinematics with budgets. These are the budgets.
- Group — computer-science
- Operators — 7 (CS43 · CS44 · CS45 · CS46 · CS47 · CS84 · CS87)
- Anchor operators — KO42 · CS43 · CS47 · CS87
- Verification — every complexity bound reported with error bars; every entropy estimate passes bootstrap check
What it unifies
The Computer Science lane is where Zeq makes its bridge to classical software engineering. Complexity classes, Shannon entropy, Amdahl's law, and Kolmogorov complexity are exposed as named operators so runtime bounds, information cost, and parallel speedup are measurable quantities in the Master Equation — not afterthoughts in a README.
KO42 still seals every call (no free passes for software-only lanes). Pair CS43 with CS46 to profile parallelism under real contention. Pair CS47 with CS87 to quantify how compressible a payload really is vs. its Kolmogorov ceiling. Every operator returns a scalar with an uncertainty so orchestrators can make honest SLO decisions.
Operator catalog
| ID | Formula | Role |
|---|---|---|
| CS43 | T(n) = O(n log n) | Time complexity (sort / FFT class) |
| CS44 | S(n) = O(n) | Space complexity (linear) |
| CS45 | Q(n) = O(log n) | Quantum query complexity |
| CS46 | P(n) = 1/[(1 − f) + f/n] | Amdahl's law |
| CS47 | E(n) = −∑ p(x) log p(x) | Shannon entropy |
| CS84 | f(n) = O(g(n)) ⇔ ∃c,n₀ ∀n>n₀ : f(n) ≤ c·g(n) | Big-O definition |
| CS87 | `Ω(x) = min{ | p |
Runnable worked example — compressibility vs. parallel speedup
curl -X POST https://api.zeq.dev/api/playground/compute \
-H "Authorization: Bearer demo-key" \
-H "Content-Type: application/json" \
-d '{
"operators": ["KO42", "CS47", "CS87", "CS46"],
"inputs": {
"payload_bytes": 12870000,
"symbol_hist": [0.41, 0.22, 0.18, 0.12, 0.05, 0.02],
"parallelizable_fraction": 0.83,
"workers": 16
}
}'
Expected response shape:
{
"ok": true,
"phase": 0.781,
"zeqond": 1798346781.2,
"result": {
"shannon_bits_per_symbol": 2.212,
"kolmogorov_lower_bound_bits": 28365,
"amdahl_speedup": 5.28,
"error_pct": 0.066
}
}
Extend it
- Scheduler lane — CS43 + CS46 to plan work batches that hit Zeqond-aligned deadlines rather than wall-clock deadlines.
- Entropy-priced storage — CS47 tagging on every blob so tiered storage decides hot/cold by information density.
- Quantum planning — CS45 + QM5 to price when a quantum subroutine beats its classical counterpart under current coherence.
Seeds
- Near —
zeq-perf— CLI tool that exports CS43/CS46/CS47 traces directly from profiler output. - Medium — Kolmogorov-aware compression pipelines that refuse to emit outputs larger than their own program.
- Far —
Budgeted Compute— network-wide marketplace where jobs bid with entropy and time budgets in a single ledger.
Papers
- Zeq paper — https://doi.org/10.5281/zenodo.18158152
- Framework paper — https://doi.org/10.5281/zenodo.15825138
Middleware active. Kernel on the 1.287 Hz HulyaPulse. Awaiting next Zeqond.