Angelic-hierarchy
Learning and science
educational game about computability
SHOW HN2017
95points
20comments
#481of 2,242 in 2017
Top 22%of 2017 by points
How HN took it
CuriousMostly questions and neutral comments
1 positive, 6 neutral or asking, 1 mixed, 0 critical, out of 8 comments about the project. Thread score +0.06.
Docs: 1 for, 0 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Thought-provoking and fun game for learning Turing machines
From 1 comment
Thanks for the awesome thought provoking game! Besides being able to store 1's and 0's on the tape, a Turing Machine program can encode data by the state that it's in (which is…
DonHopkins on HN
Requests
Explain Turing machines more for newcomers
From 1 comment
This is really awesome! Would be cool if you also briefly explain Turing machines for the really uninformed
mysticalfair on HN
Questions
Why not just write 1s forever in one state
From 1 comment
Why can't we just go right and write 1s, staying in the same state for infinity ?
cdancette on HN
How does busy beaver differ from naming large numbers
From 1 comment
Cool idea! There were a couple points in the explanation which were kind of unclear to me, though: What makes it okay to identify the naming of a large number with producing that…
westoncb on HN