What should we talk about then, glob patterns (which are NOT regular expressions, for the love of all that is holy and unholy, stop calling glob patterns RE!)
The joke is that there are some people who think that by uploading themselves into a machine “to live forever,” their consciousness will also be transferred, like when you travel by bus from one city to another. In reality, you “upload yourself,” but that yourself is not you, but a copy of you. So, once the copy is done, you will still be in your original body, and the copy will “think” it is you, but it’s not you. It’s a copy of you! So, you continue to live in your body until you die, and, well, for you - that’s it. You’re dead. You’re not living. You’re finished. Everything is black. Void. Null. Done - unless you believe in the afterlife, so you’ll be in heaven, hell, purgatory or whatever, but the point is, you’re not longer on Earth “living forever.” That’s just some other entity who thinks it is you, but it’s not you (again, because you’re dead.)
This is represented by the parameters being passed by value (a copy) instead of by reference (same data) in the poster’s image.
It wouldn’t be you, it would just be another person with the same memories that you had up until the point the copy was made.
When you transfer a file, for example, all you are really doing is sending a message telling the other machine what bits the file is made up of, and then that other machines creates a file that is just like the original - a copy, while the original still remains in the first machine. Nothing is even actually transferred.
If we apply this logic to consciousness, then to “transfer” your brain to a machine you will have to make a copy, which exist simultaneously with the original you. At that point in time, there will be two different instances of “you”; and in fact, from that point forward, the two instances will begin to create different memories and experience different things, thereby becoming two different identities.
I can’t find the name/source at the moment, but if you enumerate all turing machines and run them concurrently* you will find the optimal algorithm for your problem in O(1) and executed that.
To my knowledge the algorithm is so inefficient on small input that it takes hours to solve integer addition.
You run the first turing machine one step, than the first two one additional step, that the first tree… This allows you to run an unlimited amount of TMs an unlimited amount of steps.
How do you mean? You can’t type a word without using it in a word processor. Once the word is typed out it’s been used. Variables need to be declared then used so 2 separate steps.
What do you mean? Variables do not necessarily need to be used, you can allocate memory for some value and initialise it but then simply don’t do anything with it.
True, he is sitting at a terminal - but it appears to be connected to an IBM 5150 or similar. So maybe not so dumb!
Looking at the rest of things more carefully - very likely a 5150, if not definitely. Iconic and hugely popular PC for its era, so it would make sense for sure.
programmer_humor
Top
This magazine is from a federated server and may be incomplete. Browse more on the original instance.