p versus np problem
2 episodes mention this concept
lexfridmanJul 26, 2020Richard Karp: The Elegance of Algorithms, NP-Completeness, and the Philosophical Limits of AI
SciencePlain geometryFormal proofsComputational complexityP versus NP problem- lexfridmanDec 23, 2018
Juergen Schmidhuber on Gödel Machines, Meta-Learning, LSTMs, and the Simplicity of Universal Intelligence
TechnologyRecursive self-improvementMeta-learning (learning to learn)Gödel machinesLong Short-Term Memory (LSTMs)
Knowledge Graph
Related concepts — line thickness indicates connection strength. Click any node to explore.
Related concepts
Concepts that appear alongside p versus np problem across episodes.
- meta-learning (learning to learn)
- formal proofs
- universal problem solver
- polynomial time algorithm
- deterministic universe
- gradient descent
- turing test
- hungarian algorithm
- computational complexity
- gödel machines
- pseudo-random number generator
- transfer learning
- moore's law
- network flow problem
- np-completeness
- assignment problem
- graph theory
- intrinsic motivation/reward
- traveling salesman problem (tsp)
- max flow problem