AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
1min snip
How to Win With Prompt Engineering - Ep. 38 with Jared Zoneraich
AI and I
Embrace the Irreducible Complexity
Computational irreducibility highlights the limits of problem-solving by emphasizing that, despite efforts to simplify or collapse certain aspects, some components remain irreducible and must be addressed in full to achieve a solution. This concept suggests that in advanced artificial general intelligence (AGI), the challenge lies not just in solving problems, but in determining what problems to solve in the first place. Furthermore, it posits that the universe operates like a complex computer, where breaking down certain operations might yield no shortcuts; one must engage fully with the processes of reality to uncover outcomes.
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode