51–60 of 73 posts
https://www.goodreads.com/book/show/89197.Programming_Langua...
[stub for offtopicness]
Honestly, very cool good for you. Side note, I'd discourage leaning on your age/precociousness when doing stuff like this. It's a strategy with a limited shelf life, and sooner or later your work will have to stand on its own merit anyway.
[stub for offtopicness]
Totally unrelated to the content of your post but labeling posts with "I'm [a teenager] and X" has always irked me. It either serves to undermine the content (older people immediately questioning the authority of a teenager) or people respond with meaningless praise ("Wow, great job! I was playing video games when I was your age!"). It also harkens back to the 2000s and 2010s when the industry was obsessed with "teen…
In this conversation I see people discussing the requirements for being Turing complete. Because OP is a teen, everyone so far seems pretty nice about gently pointing out inaccuracies. I doubt they would be, or should be, as easy on me if I made similar misstatements.
And that's the value I see in "as a teenager..." here. It's not so much about their age as that they don't have decades of education and experience under their belts. Another person posting "as a professional dog groomer..." might get similar responses: hey, that's pretty neat coming from someone who hasn't been doing this for a living for many years!
Very cool. Someone correct me if I am wrong but I dont think this is accurate. >Minimally, should have the following features: variables, looping (think: for/while loops), conditional branching (think: if/else statements) and some form of recursion (think: functions). Why? These are what make a programming language Turing-complete.
In fact, NAND gates are enough to build a Turing complete machine. ;-)
Excellent work. When I was your around your age, it was QuakeC that exposed me to programming concepts and really sparked my interest in programming. If you’re interested you may want a follow up project to create a stack or register based VM.
Earlier quoted context omitted.
This comes up every time someone posts like this, and it's not really very helpful.
What are HN's guidlines on young people mentioning their age in a Show HN like this post here? Should we take it graciously, admit they are young and encourage them for what they did or should we point out not to mention their age? IMO, if we take the age out, some of show HN's might not look very interesting. Same goes for a Show HN where someone mentions they are not a programmer and yet built a thing.
Even if you dislike "I'm $X years old and I $Y" posts, it's not helpful to give a kid a grumpy patronizing response. We want HN to be a helpful community, not some weird age competition.
Very cool. Someone correct me if I am wrong but I dont think this is accurate. >Minimally, should have the following features: variables, looping (think: for/while loops), conditional branching (think: if/else statements) and some form of recursion (think: functions). Why? These are what make a programming language Turing-complete.
In fact, NAND gates are enough to build a Turing complete machine. ;-)
Typically you say that you can make arbitrary functions between any two closed domains using only NAND gates.
Earlier quoted context omitted.
In fact, NAND gates are enough to build a Turing complete machine. ;-)
How will you do unbound computation with only NAND gates? Either you need a clock (not a NAND gate) or you need to implement a clock using NAND gates, but that assumes physical aspects such as power propagation speed. Typically you say that you can make arbitrary functions between any two closed domains using only NAND gates.
Anyway, bringing up Turing completeness is overly theoretical when talking about a programming language. It's pretty hard to make a language not Turing-complete, and it doesn't say much about what you can use it for IRL.