Machine Learning Street Talk (MLST) avatar

Dexa/Machine Learning Street Talk (MLST)

Learn more

Solving NP Problems

Gary emphasizes the need for a blend of algorithms and vast knowledge databases to tackle NP hard problems effectively. The discussion delves into the challenges of optimal learning in discrete symbolic paradigms, shedding light on the importance of machine-interpretable knowledge.
  • In this clip

  • From this podcast

    Machine Learning Street Talk (MLST) avatar

    Machine Learning Street Talk (MLST)

    #54 Gary Marcus and Luis Lamb - Neurosymbolic models

  • Related Questions

    • Can mathematics solve complex problems as discussed in the episode Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 and the clip P vs NP Insights, in relation to the episode Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130 and the clip P vs NP Explained?

    • Can mathematics solve complex problems as discussed in the episode Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 and the clip P vs NP Insights, in relation to the episode Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130 and the clip P vs NP Explained?

Built by
Charlie AI
© 2024 Machine Learning Street Talk (MLST)TermsPrivacySupport