- whats the most fun way to make a snake game
- spell check algorithm - https://youtu.be/d-Eq6x1yssU?si=gcKgqsCUqr4PPP6r
- Explain this HN comment Please explain this comment: Though, of course, that’s far from the only thing you need to recognise a syntactically valid C++ program. Deciding on syntax is Turing complete in C++. (Even in Pascal, you still need to check that you only used identifiers you declared before. That’s not expressed in this diagram. But the extra rules required to get to the full language’s syntax are fairly tame compared to C++.) Syntax is Turing complete, and hence undecidable, in C++, because what’s valid syntax depends on types in some instances, and the type system is Turing complete
can be a home cooked meal - Blog: an app can be a home cooked meal https://news.ycombinator.com/item?id=38877423 poetry