@drmichaellevin
  @drmichaellevin
Michael Levins Academic Content | Associative Memory in Hopfield Networks Designed to Solve Propositional Satisfiability Problems @drmichaellevin | Uploaded March 2024 | Updated October 2024, 3 hours ago.
This is a 30 minute talk on Hopfield networks solving propositional satisfiability problems, by N. Weber, W. Koch, O. Erdem, and T. Froese (from the Okinawa Institute of Science and Technology in Japan), followed by a 30 minute discussion of potential applicability of this technique to linking the beliefs and preferences of an agent to a controller that can be used to implement them behaviorally.
Associative Memory in Hopfield Networks Designed to Solve Propositional Satisfiability ProblemsThe Bioelectric Interface to the Intelligence of the Body: the future of biomedicineDiscussion on Mortal Computations with Alexander Ororbia, Karl Friston, and Chris FieldsGlobal organization and evolution of the virus world by Eugene V. KooninHeterogeneity Extends CriticalityHigh school students project presentation on a survey of attitudes to AI and diverse intelligence.The Mortal Computation Thesis by Alexander OrorbiaDiscussion with Stuart Kauffman and Katherine Peil Kauffman 2KAN: Kolmogorov-Arnold Networks by Ziming LiuConversation between Richard Watson, Iain McGilchrist, and Michael Levin

Associative Memory in Hopfield Networks Designed to Solve Propositional Satisfiability Problems @drmichaellevin

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER