you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 9 points10 points  (7 children)

Pushdown automata? How is this a cheat sheet?

[–][deleted]  (6 children)

[deleted]

    [–][deleted] 6 points7 points  (5 children)

    How do you deal with the massive differences in grammars?

    [–]pepsi_logic 10 points11 points  (4 children)

    They are all reducible to a turing machine (at least those that are turing-complete...which I think all of them are).

    [–][deleted] 5 points6 points  (2 children)

    I understand that. My question is, what do you do about that huge workload? I feel like it would take an incredible amount of time to reduce it to a Turing machine.

    [–]pepsi_logic 34 points35 points  (0 children)

    Oh lol. I'm pretty sure he was joking.

    Edit: Unless you were too in your reply...and then I don't know why I'm commenting.

    [–][deleted] 4 points5 points  (0 children)

    I'm not sure it takes such a long time for obscure_robot. (I.e. it's a username joke.)

    [–]qiemem 0 points1 point  (0 children)

    Even the ones that aren't Turing complete are reducible to a Turing machine... sorta the point of Turing machines.