Descriptional Complexity of Formal Systems

Mota, F., Aaronson, S., Antunes, L., & Souto, A. (2013). Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science.

Type

Book chapter

Intellectual base

Review or monograph

Year

2013

DOI

10.1007/978-3-642-39310-5_17

ISBN

9783642393099

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/978-3-642-39310-5_17

Cited by

1 citation across 1 artifact.

Domain-specific

• Sophistication (complexity theory)
  • Sophistication separates meaningful model structure from residual randomness using Kolmogorov complexity, but depends sharply on the significance parameter and universal description language up to invariance limits.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:b40bf047642c · see in the full table