question
active
question:can-we-characterize-polynomial-time-computation-and-other-complexity-classes-in-such-termsCan we characterize polynomial-time computation and other complexity classes in such terms?
Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Load-bearing quote from SICP framing computation as spirit-like; grounds the cyberanimism framework
- Paper's interpretation of Gödel's incompleteness result as motivating computationalism
- Asserts that Linda's uncoupled style reduces cognitive load.
- Concise statement that underscores the necessity of the generated process for real complexity.
- Second of three speculative claims asserting that subgraphs of neural networks are tractable and meaningful objects of study
- Feature presence depends on concept frequency in training data, with a threshold scaling inversely with alive features.
- The class of explanations from the Santa Fe Institute tradition, including attractor dynamics and emergent order, evaluated as insufficient to fully explain the appearance of living structure