Technology News Related Podcast On The Tech Podcast Network

Solving Exponential Problems in Polynomial TimePretty much all of computing rests on the strong foundation of the Turing Machine, a general purpose formulation of computing which happens to be very sequential. It transfers that attribute to the Von Neumann architecture that manifests it and leads to the famous Von Neumann bottleneck.It would be good if an inherently parallel foundation existed. That requires a blending of computing and memory and has led to approaches to build processor-in-memory or computational memory systems. If successful, it could help reach the nirvana of solving (some?) exponential problems in polynomial time by exposing the intrinsic parallelism of large scale problems.The @RadioFreeHPC team delves into this topic with the folks at MemComputing, a San Diego startup that's built a new parallel foundation for computing. It calls it the universal memcomputing machine, and a "realization of self-organizing circuits".It's a lively discussion with co-founders John Beane, CEO, and Fabio