jwgarber
[0] https://anopheles-genomic-surveillance.github.io/home.html
Also gotta shout out to these incredible molecular animations by WEHI: https://www.youtube.com/watch?v=7Hk9jct2ozY
> Public health officials say it started when an international traveller attended a wedding in New Brunswick last October. New Brunswick's outbreak ended in January, but guests at that wedding had already brought the virus to southwestern Ontario, where that province's outbreak was concentrated among closely knit Mennonite communities.
International travel + spread among low-vaccination communities.
https://www.cbc.ca/news/health/livestory/canada-measles-elim...
For the rebuttal you posted, I'll respond to one thing:
> The entire rant is basically about how OpenPGP is old and therefore bad and how new things, sometimes only vaguely defined, are good. So let's address this first.
> If someone, while trying to sell you some high security mechanical system, told you that the system had remained unbreached for the last 20 years you would take that as a compelling argument. You would be unlikely to demand a newer design. Normally old designs that have stood the test of time are valued. Cryptography is based on mathematical/logical principles. Such principles don't age out on any sort of a schedule and are valued in some cases for thousands of years.
The "unbreached for the last 20 years" conclusion about mechanical security systems does not immediately apply to mathematical ones, and we can indeed see that it is empirically incorrect. The cryptographic world is littered with the corpses of cryptographic algorithms that were secure for decades and are now broken (MD5, SHA1, DES, small RSA keys, TLS 1.0), and their C implementations that had horrible vulnerabilities (HeartBleed, etc). Mathematical proofs will not help us here either, since e.g. there is no proof that GPG is IND-CCA. (Which is unlike new systems, which do have proofs!) GPG had its day, and now it should be retired.
Also, the quantum threat is a reasonable one in the "store now, decrypt later" model. A lot of people presumably use git to store their password store online and would be vulnerable to this. The passwords in the files would probably not be important anymore once quantum computers are created, but any other long term data or other personal information that people store in there could be decrypted.
https://codeberg.org/jwgarber/napa/src/branch/main/database....
Blocking Sudo Exploits with Fapolicyd
(In)Security of the "Pass" password manager (2021)
The Crushing Complexity of the GPL3
A Turing Machine that halts iff ZFC is inconsistent
Hey that's me! :)
https://web.archive.org/web/20190717062201/https://f-droid.o...
Public Statement on Neutrality of Free Software
Aegis – A Secure OTP App for Android
[1] https://github.com/beemdevelopment/Aegis
[2] https://old.reddit.com/r/androidapps/comments/b45zrj/dev_aeg...
> But, in addition, the Zeta function represents the whole numbers as a sublated unity, where the entities internally relate via the exchange of a conserved substance. And this whole moves and changes with time. This is quite unlike the vision offered by set theory.
The way modelling normally works is you have a certain phenomenon (falling rocks, fish populations, market booms-and-busts) that you attempt to describe numerically, and then create a mathematical model to make conclusions about the phenomenon. Here we have the opposite: the author takes the phenomenon (the Hegelian contradiction) and uses the model to make conclusions about mathematics!
OLinuXino – Open Source Hardware Boards
First of all, what you're about to do is an very large endeavor - mathematics is a difficult subject, and learning math will take great persistence and self-motivation, especially if you are self-learning. However, it is also extremely rewarding - mathematics is a beautiful subject, and learning math has easily been one of the most enjoyable things I have ever done.
For the next point, if you want to go deep into math, then you will have learn how to prove things. The heart of math is not at all computation, but ideas, and to know that ideas are true, we need proofs. All of pure mathematics is based on rigorous formal reasoning and proofs, and sadly, most high schools and even universities never touch this part of math. If you have never seen proofs before, I would first recommend reading the book How to Prove It: A Structured Approach by Daniel J. Velleman, which goes through basic set theory, logic, and various proof techniques. Most importantly, it will give exercises for you to practice. Let me say this now: it is impossible to learn math without doing exercises. Again, this will take some work, and the beginning may be a bit slow, but as I said above, it is extremely rewarding - there are few things so satisfying as finding a beautiful, clean, or elegant proof. I hope you will enjoy this as much as I have.
Now then, let's dive into the courses and textbooks. I'm going to model this after what I did in my degree. Many of these topics require earlier ones as prerequisites, so I'm going to organize them into several layers. Some of the textbook recommendations may be a bit difficult, since in many of my classes the professors taught out of their own notes and left textbooks only as references, but I'll do my best. In your "first year", so to speak, there are three main things to learn:
- Single variable calculus, differential and integral. You likely know calculus already, but again, we are now taking the proof based road! The canonical text for this topic is Calculus by Michael Spivak. It's what I used in my first year, and most importantly, comes with a solution manual :)
- Linear algebra. As others have noted, linear algebra is absolutely crucial for many other subjects. I personally learned from Algebra by Michael Artin, but have heard very good things about Linear Algebra Done Right by Sheldon Axler, so I'd probably start there.
- Graph Theory and Combinatorics. These are I think are somewhat more accessible than the others (perhaps at least more intuitive), so I might actually recommend trying these first. For the basics, try A Walk Through Combinatorics by Miklos Bona.
By the way, whenever I need to find a textbook on a subject, I just Google "best (subject) textbook", and try to find the Math Stack Exchange post where someone has asked this question. (Eg. here's [0] the one for graph theory, which is where I got the combinatorics book.)
Now, this post is already getting long enough, so I'll post this for now and follow up the rest in another comment.
[0] https://math.stackexchange.com/questions/27480/what-are-good...