Wouldn’t this just prevent you from allocating more memory (than zero)?

Nope. I only learned to use computers as an adult, and only learned programming incidentally as a tool for other work.

The truth is that it’s actually much faster to learn as an adult, you just have more momentum if you start as a child.

Ada particularly the SPARK subset. It’s approach is quite different than most languages, focusing on minimising errors and correctness. It’s fairly difficult but I like to use it to teach people to actually understand the problem and how to solve it before they ever write the code.

This blog covers a lot of topics, but very superficially.

This blog covers a lot of topics, but very superficially.

California HSR has been a zombie project for a while. Even before Musk was a factor, there were annual plans but nothing ever got done, year after year. It’s probably going to take intercity projects to become popular and economical for something as ambitious as long-range passenger rail to actually receive serious attention.

Splitting individual atoms isn’t that difficult, you just need a neutron supply and some material (paraffin wax works) to slow them down and it will eventually happen at least with uranium. Doing it reliably and efficiently is a much harder problem.

“From computer science papers/academic texts I know this method of reading works perfectly”

This is almost certainly due to pure familiarity. CS papers are just as indecipherable to unfamiliar persons. Possibly even more since things like complexity are heavily used, without any explanation of what it is. Data structures are another common one that the vast majority of non-CS people would not understand when referenced.

I know because this is exactly how I felt coming from an intermediate mathematics background.

“So many papers are extremely hard to read because the formulas are obfuscated like that”

This isn’t really an issue though, of you don’t have enough foundational knowledge to understand what the formula means or how it could be conceivably derived, does knowing how it’s calculated matter?

Mathematicians are good at writing algorithms, but not at the development aspect, which is basically building for different systems, packaging software and documentation.

I would disagree on the performance part, the vast majority of software developers aren’t writing high performance software and the ones that are tend to be computational mathematicians or physicists.

“seeing the differences in the result”

This just means that you are testing against a very narrow output. It’s actually pretty common to run across tests that don’t even check for the likely failure cases, because the developer(s) don’t actually understand the algorithm.

A common example is prime factorisation, most nontrivial factorisation algorithms (Pollard rho, elliptic curves), don’t guarantee producing a prime factor they simply tend to produce them because they prioritize small factors. Programmers see that their function produces primes for the one or 2 test cases (out of say 2^64) and assume that it works. It generally does, but when it doesn’t you get incorrect results (often undetectably) which poisons all the rest of your calculations.

Some people (like myself and other scientists/mathematicians), write software for specific fields so if you follow them you find it out what work they are putting out, and issues they find in other software etc.

You could write bindings to machine-prime . Hardly anything challenging for an actual programmer, but I’ll take the free labor if it is available.

If you’ve spent any time on the “dark web” this is super-obvious. They all love encryption, and most software developers are completely incompetent when it comes to encryption so backdooring an app is trivial. Hell, even well-known crypto libraries have implementations that rely on clearly false assumptions.

CamelCase directories and snake_case files.

You realise that most encryption can be decrypted by third-party? Many cryptography libraries have huge flaws, even the Handbook of Applied Cryptography was encouraging using Damgard et al’s parameters for prime selection even though the original authors never claimed the accuracy that others assumed (without basis). Even now, can you guess how many cryptography libraries would be broken if someone found a BPSW pseudoprime? And we have arguments that they probably exist, but crypto developers just ignore it either out of ignorance or laziness.

In summary, it’s all theatre, you just want to deny access to enough parties that it makes you comfortable.

Encryption only works if certain parties can’t decrypt it. Strong encryption means that the parties are everyone except the intended recipient, weak encryption still works even if 1 percent of the eavesdroppers can decrypt it.