Earlier quoted context omitted.
Doom is Turing complete ( https://calabi-yau.space/blog/doom.html ), so it's just a matter of building the appropriate map.
(author here) _yes I realize how ridiculous what I'm about to say is considering the project I just shared_ but I actually strongly disagree, haahah. there's this thing I learned of called "the turing tarpit". my position is that just because something could theoretically be done with infinite time and infinite resources, doesn't mean you can even approach the throne of doing it for real in a human lifetime. And if I…
TypeScript types can run DOOM [video]
71–80 of 391 posts
Re: TypeScript types can run DOOM [video]
#72Re: TypeScript types can run DOOM [video]
#73> If this guy goes for a big tech interview they're still going to ask him how to invert a binary tree
The industry's hiring process is so messed up that this is completely believable.
"We've decided to prioritize other candidates, as you are strong in the fundamentals but lack the kind of experience in Vue that we're looking for."
Re: TypeScript types can run DOOM [video]
#74I wonder if there will come a time when the HN audience will stop being amazed that some system is Turing complete, or that any Turing-complete system can run Doom (barring resource constraints). Maybe I’ve just seen it too often. The fact that TypeScript’s type system is Turing-complete was shown back in 2017 [0], and then of course you can run Doom on it. [0] https://github.com/microsoft/TypeScript/issues/14833
Re: TypeScript types can run DOOM [video]
#75I wonder if there will come a time when the HN audience will stop being amazed that some system is Turing complete, or that any Turing-complete system can run Doom (barring resource constraints). Maybe I’ve just seen it too often. The fact that TypeScript’s type system is Turing-complete was shown back in 2017 [0], and then of course you can run Doom on it. [0] https://github.com/microsoft/TypeScript/issues/14833
Re: TypeScript types can run DOOM [video]
#76At this point the easiest way to know if a system is Turing complete is to check if someone has ported DOOM to it haha Very impressive!
Re: TypeScript types can run DOOM [video]
#77I wonder if there will come a time when the HN audience will stop being amazed that some system is Turing complete, or that any Turing-complete system can run Doom (barring resource constraints). Maybe I’ve just seen it too often. The fact that TypeScript’s type system is Turing-complete was shown back in 2017 [0], and then of course you can run Doom on it. [0] https://github.com/microsoft/TypeScript/issues/14833
The time is now, but if you had said
> I wonder if there will come a time when the HN audience will stop being amazed that some system can run Doom
The answer is never, and particularly not when its this insane to even try
Re: TypeScript types can run DOOM [video]
#78I wonder if there will come a time when the HN audience will stop being amazed that some system is Turing complete, or that any Turing-complete system can run Doom (barring resource constraints). Maybe I’ve just seen it too often. The fact that TypeScript’s type system is Turing-complete was shown back in 2017 [0], and then of course you can run Doom on it. [0] https://github.com/microsoft/TypeScript/issues/14833
Re: TypeScript types can run DOOM [video]
#79>> @TimMattison >> If this guy goes for a big tech interview they're still going to ask him how to invert a binary tree
> @MichiganTypeScript > So actually in the "why" video, you're going to hear about exactly that! I was looking for a job during working on this and absolutely got some disappointing rejections, and one was because of my lack of skillset on things like this in a big tech company's interview. I literally failed the technical screening. Oh well.
Re: TypeScript types can run DOOM [video]
#80I wonder if there will come a time when the HN audience will stop being amazed that some system is Turing complete, or that any Turing-complete system can run Doom (barring resource constraints). Maybe I’ve just seen it too often. The fact that TypeScript’s type system is Turing-complete was shown back in 2017 [0], and then of course you can run Doom on it. [0] https://github.com/microsoft/TypeScript/issues/14833
1) Show that a system is Turing complete
2) ???
3) Run Doom on it.
Step 2 is, of course, always trivial, and no amount of effort or technical nous that goes into actually getting to step 3 can possibly be relevant.