There are bindings in java and c++, but python is the industry standard for AI. The libraries for machine learning are actually written in c++, but use python language bindings. Python doesn’t tend to slow things down since machine learning is gpu-bound anyway. There are also library specific programming languages which urges the user to make pythonic code that can be compiled into c++.
I completely agree that it’s a stupid way of doing things, but it is how openai reduced the vocab size of gpt-2 & gpt-3. As far as I know–I have only read the comments in the source code– the conversion is done as a preprocessing step. Here’s the code to gpt-2: https://github.com/openai/gpt-2/blob/master/src/encoder.py I did apparently make a mistake, as the vocab reduction is done through a lut instead of a simple mod.
Can’t find the exact source–I’m on mobile right now–but the code for the gpt-2 encoder uses a utf-8 to unicode look up table to shrink the vocab size. https://github.com/openai/gpt-2/blob/master/src/encoder.py
This might be happening because of the ‘elegant’ (incredibly hacky) way openai encodes multiple languages into their models. Instead of using all character sets, they use a modulo operator on each character, to make all Unicode characters represented by a small range of values. On the back end, it somehow detects which language is being spoken, and uses that character set for the response. Seeing as the last line seems to be the same mathematical expression as what you asked, my guess is that your equation just happened to perfectly match some sentence that would make sense in the weird language.
Yeah, mine. EYYYYOOOOO! (I may or may not have ED)
Oh, so the goal is to get the certain doom?
“An anaconda that is sprung?” What does that mean?
At first, I thought you were referencing the Old testament.
If C++/C were real languages for real programming they’d enforce unreadability in the compiler.
No sane language designer would say “It is imperative that you write the most unreadable code possible” then write a compiler that says “oh your code doesn’t triple dereference pointers? lol lmao that rocks”
They have played you all for fools.
I think one could argue that fantasy isn’t based on the reality of the medieval ages, but on the collective beliefs and myths of that era.
As a side effect, though, the countryside would probably be filled with giant snails that you’d have to fight.
Rust is the WORST programming “language.”
When playing overly smart characters I tend go less for loquaciousness and more for confusing amounts of double entendré. Like how a temple might be incensed if I gave them the wrong perfume.
Recently, I’ve just given up trying to use cuda for machine learning. Instead, I’ve been using (relatively) cpu intensive activation functions & architecture to make up the difference. It hasn’t worked, but I can at least consistently inch forward.
I’m not sure I understand your argument. Are you saying that the emulated processor executes instructions while the SoC doesn’t? Every instruction that goes to the x86 is broken down into several SoC instructions, which the SoC executes in order to emulate what an x86 would do. Saying that the emulated x86 is booting/running Linux, but the SoC is not is like saying that computers can’t run java code, they can only run jvm.
I respectfully disagree. The turning machine is not doing any set-up before the emulated CPU begins execution, and all of the actual BIOS is done by the emulated CPU.
Emulated processors can do the same things as physical processors, including booting from disk.
Yes. Any turing complete processor can perfectly emulate any other turing complete processor, whether it is x86, arm, or riscv. Mainline Linux can then run on this emulated processor without modification.
Anything that’s turning complete, has enough ram, and has a c compiler can run Linux. Theoretically, you could program a CPLD to run brainfuck and you could still run Linux.
It’s a common misconception that DNA is exactly the same across the body. Skin, for example is heavily mutated due to it’s constant exposure to the sun, which means the DNA you can scrape off your right hand will be slightly different to the DNA you scrape off your left hand. The way DNA matching works in the real world is not infallible. Instead of matching the base pairs of the DNA sequences, several common markers are picked out and tested against markers from other people. For this reason, it may not be necessary to hash the data at all. You just need to send & receive snippets of the DNA. Furthermore, some large percentage of DNA is just junk data, which is identifiable but tells you nothing about the person who is being DNA tested. In short, hashing is not needed for security purposes.
Everything can be done in constant time, at least during runtime, with a sufficiently large look-up table. It’s easy! If you want to simulate the universe exactly, you just need a table with nxm entries, where n is the number of plank volumes in the universe, and m is the number of quantum fields. Then, you just need to compute all of them at compile time, and you have O(1) time complexity during runtime.