Superficially similar, yes, but my point was just that it may seem from your bunching up the links together that all refer to the same thing, while they don't.
I'm pretty sure the first two links refer to something very different than the third:
The first two are about a way to encode maths using unicode, as in conventions and special characters allowing e.g. to write fractions, aligned equations, etc.
So, this would essentially furnish an alternative to the "math" subset of latex (think mathjax or katex) or mathml.
The third is a package for latex, and allows to use unicode symbols (greek letters, math symbols, etc.) in your math environments + something related to the use of unicode in the output (requiring compatible fonts); it seems the second part is the main one but I'm not sure what that means exactly.
Something I'd like to see is a simple way to define “containers” on my desktop that would allow me to run sandboxed versions of my standard apps in bundles.
The plan would be something like the following.
You have a simple gui that would allow you to create new containers, for which you could define what it has access to (specific folders, internet, sound, etc).
You could then add apps to your container, and they would only be able to play with each other in the container with the restrictions given.
I think that would work with a simple app essentially based on bubblewrap.
For example:
* A "torrents" container, where the only apps would be firefox, deluge and vlc, and access to no folder in my home directory, but the container would have its own home directory.
* An "admin" container, with only firefox and thunderbird and libreoffice, say, and access to my ~/Downloads and ~/Documents folders.
You should be able to run the admin.firefox and torrents.firefox side by side, since they'd have different profiles.
By default, each container would have its own "virtual filesystem" with no accesss to anything outside (modulo what's really needed), and only by toggling "links" would it be able to access your actual fs tree.
The GUI would be easy enough for computer "illiterate" people to work with it.
And the GUI would be smart enough to create desktop files with each new application I add to a container, with customized icons.
I don't expect it would be too complicated (essentially bookkeeping on top of bubblewrap).
If anyone is interested, I'd happily discuss it more!
> people still can be harmful even being in good faith
That's a general truth.
You make it sound like people choose academia to somehow cheat the system and profit from free student's work or whatever.
Make a real case for you thesis then.
> I am generally suspicious of anyone who voluntary pursues academia
That's very unfair imo.
The majority of people I know in academia don't fit this profile at all.
There is obviously disappointing stuff happening, but people generally still are working/teaching in good faith.
It's not necessarily about becoming famous.
If you're good enough, you can just work on what you enjoy doing, and it will probably yield something research worthy anyway, and your bosses will be happy, etc.
Otherwise, you might end up simply having fun on dead-end stuff, which are harder to sell, academically.
But that's just my impression… mind sharing your story?
I often find using interrail.eu to be a good option.
Much more elastic, and can quickly get financially interesting, even more so for multi-hop travels.
> Anybody who's overweight or obese can't be credible if they act concerned about climate change and won't do something as simple (and without cost) as eating less food.
For one, I don't think it's "as simple", and for two, the pattern "if you don't do X, you're not serious/credible/honest/worthy" is unhelpful.
I was bothered (for lack of a milder word!) by your use of "proved".
As far as I understand, the major problem is that "algorithm" is sort of undefined.
To actually prove that TMs are universal, you need to set the formal stage, which implies having a formal definition of an algorithm.
But this is not really done, and Church-Turing essentially states that any reasonable formalization of algorithm ends up being equivalent.
But this is not tautological at all, to me.
> recursive functions alone are not sufficient to describe all computation.
Any function computable with TM is recursive, and vice versa, so they should be, if you understand "computable" as "computable with a TM".
I don't see how this "functions as first class" comes into play here, but I'd be interested anyway?