Published package / CLIR

`arxo.computational_complexity`

v0.1.0

Словарь вычислительной сложности: язык/задача/машина Тьюринга/сертификат, классы P и NP, сведения Karp и Cook, NP-трудность и NP-полнота из обоих оснований

The version is immutable: the content at this address never changes.

The descriptor below is exactly the record the resolver puts into law.lock. Its shape is normative ($defs/LockedPackage of the lockfile schema), so publication status is expressed by the section of the catalogue rather than by a field inside it: an extra field would make the descriptor invalid.

{
  "contentHash": "sha256:6082eaf7c1744168764d0fbd33e2c42e83390929eae24b2bda72fd55e45fc3f8",
  "features": [
    "core-executable"
  ],
  "name": "arxo.computational_complexity",
  "namespace": "urn:arxo:arxo.computational-complexity",
  "registryId": "law-dsl-dev",
  "resolverUri": "registry://law-dsl-dev/arxo.computational_complexity/0.1.0",
  "version": "0.1.0"
}

Signature

Not issued. The field schema exists (signature: algorithm, keyId, value); an issuer and keys do not: a signature attests the provenance of the bytes, not the legal correctness of the rules, and is a separate piece of work.