『Computational Irreducibility and the Simulation Hypothesis: What the Math Really Says』のカバーアート

Computational Irreducibility and the Simulation Hypothesis: What the Math Really Says

Computational Irreducibility and the Simulation Hypothesis: What the Math Really Says

無料で聴く

ポッドキャストの詳細を見る
In this episode Josh Linsk unpacks computational irreducibility—systems that refuse to be shortcut—and explores how it feeds into Bostrom’s simulation argument, its philosophical implications, and what it really tells us about our reality. Learn more about your ad choices. Visit megaphone.fm/adchoices
adbl_web_anon_alc_button_suppression_t1
まだレビューはありません