A card from a free library — ask anything, no account, works offline. Every card carries its source.
Computability and complexity — Turing to P vs NP
computer science
A Turing machine defines what is computable; the universal machine runs any program (the engine, the laptop, the brain's computation). Some problems are undecidable (the halting problem); among the decidable, how fast is the open P vs NP question. Rests on P vs NP and the mind.
source
Narrow Highway — computer science
card id
card_cs_computability
address
WIT.codex.FCT/computability-and-complexity-turing-to-p-vs-np/REF.WITNESSED@narrow-highway
adjoining cards
- part of → Computer science — bits, logic, and what can be computed — a pillar of computer science (Computability and complexity)
- connects at → The P versus NP chain - from the machine and the circuit to the three barriers — computability and complexity - the halting problem and P vs NP
- connects at → The mind — matter aware of itself — the brain computes - neural networks borrow its shape
Is this card incomplete? Tell the library — it will call out for more ↗