He also used a compiler, but real programmers never do that. Maybe he used an IDE like Visual Studio that does a lot of real-time checking to make sure the code is correct before the compiler runs. Don't even get me start on the fact that he used off an off-the-shelf von neumann machine. Basically, the ghost of Von Neumann did allllllllllll the actual work and this guy is taking all the credit.
If you aren't writing your own Turing machine code in a language you developed, proved that language is Turing complete on the system you built, by hand(no help needed right?), that simulates the Turing structure on a state machine, you are not a programmer. Then, of course, wrote the OS(what's the name of your OS? I trying to become a real programmer and needs some pointers on scheduling). Don't forget to come up with your own machine learning model that doesn't use any of Shannon's llllllllame theories, doesn't rely on SVMs, neutral networks, or those weird upside trees(yuck) that those total losers with no programming skill what-so-ever, use.
Oh wait, you're still not a real programmer then; I almost forgot that the CT thesis is TOTAL unproven BS. No real programmer would stand for that. They are so logical and perfect in their understanding. So, if you can spare a minute from all the real programming you are doing, you should probably come up with your own model of computation, just so no one calls you out for not being a real programmer. Which, of course, you are. Wolfram did it and _everybody_ loved his "original" work. Of course, you'll then prove that this model can solve the halting problem in O(1). Wait, wait, wait, while you are at that, the PH hierarchy is also total unproven BS(look at me being so forgetful, I'm just not a real programmer, yet). Can you even believe that all those idiot nonprogrammers ever proved was P < EXPTIME, duuuuuuuuuuuh. You'll need to come up with your own classification system that isn't so broken. You don't even need to do much(what is NP even? And who decide to call it Merlin-Arthur? Is that a joke? Real programmer never joke about code.) because all your real code will run in polynomial time and always be deterministic...
What a Charlatan, amirite?
Programmers/Data Scientists stand on the shoulders of giants so large it is a serious undertaking to fully realize just how high up one truly is.
If you aren't writing your own Turing machine code in a language you developed, proved that language is Turing complete on the system you built, by hand(no help needed right?), that simulates the Turing structure on a state machine, you are not a programmer. Then, of course, wrote the OS(what's the name of your OS? I trying to become a real programmer and needs some pointers on scheduling). Don't forget to come up with your own machine learning model that doesn't use any of Shannon's llllllllame theories, doesn't rely on SVMs, neutral networks, or those weird upside trees(yuck) that those total losers with no programming skill what-so-ever, use.
Oh wait, you're still not a real programmer then; I almost forgot that the CT thesis is TOTAL unproven BS. No real programmer would stand for that. They are so logical and perfect in their understanding. So, if you can spare a minute from all the real programming you are doing, you should probably come up with your own model of computation, just so no one calls you out for not being a real programmer. Which, of course, you are. Wolfram did it and _everybody_ loved his "original" work. Of course, you'll then prove that this model can solve the halting problem in O(1). Wait, wait, wait, while you are at that, the PH hierarchy is also total unproven BS(look at me being so forgetful, I'm just not a real programmer, yet). Can you even believe that all those idiot nonprogrammers ever proved was P < EXPTIME, duuuuuuuuuuuh. You'll need to come up with your own classification system that isn't so broken. You don't even need to do much(what is NP even? And who decide to call it Merlin-Arthur? Is that a joke? Real programmer never joke about code.) because all your real code will run in polynomial time and always be deterministic...
What a Charlatan, amirite?
Programmers/Data Scientists stand on the shoulders of giants so large it is a serious undertaking to fully realize just how high up one truly is.