TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Braid is undecidable (2014) [pdf]

136 pointsby cjgalmost 10 years ago

6 comments

Sniffnoyalmost 10 years ago
A note -- if you&#x27;re linking to arXiv, it&#x27;s better to link to the abstract (<a href="http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1412.0784" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1412.0784</a>) rather than directly to the PDF. From the abstract, one can easily click through to the PDF; not so the reverse. And the abstract allows one to do things like see different versions of the paper, search for other things by the same authors, etc. Thank you!
xacaxulualmost 10 years ago
I felt sad when I finally completed Braid. It&#x27;s still one of the best games I&#x27;ve ever played and I knew I was never going to find something like that again. This paper brought me back to that sense of wonder that I had the first time I played Braid.
评论 #9648217 未加载
评论 #9648606 未加载
评论 #9650536 未加载
评论 #9649191 未加载
spraneshalmost 10 years ago
What an excellently well written paper! It does all the basics right - describes it&#x27;s objective, the domain of the problem, a quick example (Rush hour) to nudge some intuition toward the reader, before going on to prove undecidability. It even tackles the decidability of another &quot;should-obviously-work&quot; (Bounded braid) idea that the author had (turns out to be decidable).<p>Also, I wonder if most programmers have unknowingly built a ton of Braid intuition because of the way the time reversal tree matches the way we model the undo tree in $EDITOR.
wolfgkealmost 10 years ago
It is rather easy to build behaviors in systems that are Turing-complete (thus undecidable). What is more complicated is building nontrivial models (i.e. showing complex behavior) that are still decidable or even decidable in polynomial time.
评论 #9648817 未加载
ericye16almost 10 years ago
Jonathan Blow, creator of Braid, is coming out with a new game called &quot;The Witness&quot; pretty Soon™.<p><a href="http:&#x2F;&#x2F;the-witness.net&#x2F;news&#x2F;" rel="nofollow">http:&#x2F;&#x2F;the-witness.net&#x2F;news&#x2F;</a>
评论 #9648545 未加载
评论 #9650480 未加载
gremblealmost 10 years ago
I could use some guidance, as I seem to have gotten lost.<p>The implementation of the counter is IO (the levers that Tim pulls), ADD, SUB (branch if 0), M1 (the counter).. and then M2.<p>M2 is the counter that holds the monsters as they are subtracted from M1. It is also used as IO for the branch part of SUB (if I understood the article correctly).<p>Therefore, if I call SUB with M2 = 0, then the counter will malfunction.<p>I think that the consequence of this is that the given function has a decided halting point.(Branching was taken out). I have no idea how to say this in a better way, sadly my computer science education is tragically lacking.
评论 #9649739 未加载