I Built a COMPUTER in Magic: The Gathering
推荐理由
Because Science did a thorough breakdown and demonstration, using actual cards
说明
这是2019年由Because Science发布的一部演示,主题归在Computability & complexity theory。它讲的是magic the gathering turing completeness这一支里的具体问题,而不是把整个领域扫一遍。适合按兴趣直接看、不打算先补课的人。内容上可以概括成:Kyle Hill of Because Science explains and demonstrates, using real cards, how Magic: The Gathering can be used to build a Turing machine, a computer inside the card game.这些读者给出的理由,核心是:HN links it as the accessible, hands-on demo behind the claim that Magic is Turing complete.讲法不绑某一条新闻,过几年仍然可以当材料看。从2019年到2026年,有3位不同的读者在3个不同月份把它推荐出来,其中明确叫别人去看的有0次。适合先看结果再决定要不要深挖的人。先看它做成了什么。如果已经会了基本定义,就把注意力放在它怎么把magic the gathering turing completeness变成能跟着复述的例子。
视频信息
- 频道
- Because Science
- 时长
- 22 分 54 秒
- 发布年份
- 2019
同主题更多
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
- 28c3: The Science of Insecurity
- "Propositions as Types" by Philip Wadler
- Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
- Math's Fundamental Flaw
- On The Turing Completeness of PowerPoint (SIGBOVIK)