Constructible resource bounds
A time bound t(n)≥n is time constructible here when a Turing machine on unary input 1ⁿ can write 1ᵗ⁽ⁿ⁾ in O(t(n)) time.
Key knowledge
A time bound t(n)≥n is time constructible here when a Turing machine on unary input 1ⁿ can write 1ᵗ⁽ⁿ⁾ in O(t(n)) time. A space bound s(n)≥log n is space constructible here when its value can be computed from 1ⁿ in O(s(n)) workspace. These hypotheses allow a simulation to enforce its resource budget.
Conditions and scope
- Bounds are positive integer-valued; rounding logarithms and ignoring finitely many small n do not change these asymptotic classes.
- These are the stated construction conventions, not a claim that every computable function can be computed within its own value as a resource budget.
Sources · 2
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Cornell Lecture 3 Definition 3.1, printed page 3; Oxford slides 6, pages 5–6, space-constructible definition and budget counter. Common polynomial bounds such as n²,n³ satisfy these bounded conventions.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-constructible-resource-bounds
- Revision
- university-core.1
- Structured reference record
- University core expansion