This article is about “solving” differential equations and not convex optimization.
1,706 karma · joined March 5, 2014
But what I get from this is: The project switched away from 3 clause BSD to something that is less permissive.
If hundreds of commits are baked into a software - under an open source license but without the full copyright transferred to a central legal entity - then it becomes impossible to change the license post-hoc.
For a project I made a version that uses the memory location of the entries to construct the (random) rank on the fly.
So it’s a binary tree structure that requires the same memory as a linked list (two pointers) only!
https://github.com/open62541/open62541/blob/master/deps/zipt...
So at any point OpenAI could declare that a sufficient degree of AGI has been achieved and thus return to its philanthropic mission. With GPLed models and all.
However, at this point the employees expect a multi-million cash-out for each of them. So the philanthropic mission seems to be gone out the window.
And probably that’s also the way Sam Altman got back into the CEO role. By maximizing the expected eventual cash-out for the employees which threatened to leave otherwise.
If people don’t have taste, no rules will get you to good code. Only a bit less worse / better predictable behavior.
So it is easy to make changes by system admins/non-developers. Scripting is for glue functionality after all…
It is not possible to mandate "though shall write good code" because it is not at all clear what that means. Instead they needed to come up with rules that can be checked with automated tools.
The rules are classified as mandatory, required or advisory. Only the mandatory rules cannot be overridden by explicit documentation. As an example, "The goto statement SHOULD not be used" is an advisory rule. Given the bad bad spaghetti code that beginner programmers produce with goto, this is quite reasonable. Even though some code is definitely better with goto. For example to jump to some cleanup before returning.
Similarly, "A function SHOULD have a single point of exit at the end" is an advisory rule only. The rationale for the rule stated in the standard is the following (slightly rephrased):
1. A single point of exit for a function is required by the IEC 61508 and ISO 26262 standards as part of the requirements for a modular approach. 2. Early returns may lead to the unintentional omission of function termination code. 3. If a function has exit points interspersed with statements that produce persistent side effects, it is not easy to determine which side effects will occur when the function is executed.
I'm also a big advocate for early return. But the points from the rationale are valid. And I don't have a good alternative rule that achieves the same goal and is checkable with automated tools...
The Moore Microprocessor Patent Portfolio was very lucrative. Eventually it ended up with a patent marketer. Nearly everyone doing processors had to buy in.
And as the inventor Chuck got his share out of it...
https://web.archive.org/web/20071226155608/http://www.linuxe...
Your code has an accidentally quadratic runtime (instead of linear). Since the array is appended to, the code regularly increases the memory region and has to move all the previous data over.
You could pre-allocate the memory as n is known ahead. Also you don't need all that memory. You only need to store the last two entries.
I think speaking English in itself was never a problem to get in. But of course the tourist vibes get stronger if the person doesn't know the "definition of cool" that is expected and appreciated in that particular club.
Take this example [1] of a tourist they probably let in by accident and regretted it. :)
Is your house especially insulated to get that low?
To give an impression of the style, this is the C-implementation of a K interpreter. Have fun deciphering that.
Also see https://microcorruption.com. You don’t need Linux-specific knowledge. It directly goes to MSP430 assembly. A nice and compact introduction to exploiting binaries and embedded systems.
He designed it as a village inside a single building. And the apartments are still sought-after.
By selecting an appropriate norm (in function space) you can minimize either the maximum error or the error integral over some range (e.g. the 0-\pi range).
Here's a video on the subject. You might want to watch earlier ones also for more context.
https://www.youtube.com/watch?v=tMlKZZf2Kac&list=PLdkTDauaUn...
Full disclosure, this is my university lecture on optimization that was recorded during Covid.
Germany splits students into highschool (called Gymnasium, the academic track) and the vocational tracks at age 10.
Smart-kid highschool in Germany definitely moves faster than US highschools. Some even teach Greek and Latin for a well-rounded humanist education.
Here's an open source implementation of k: https://codeberg.org/ngn/k/
kdb is a time-series database with deep integration to k. It is famously used in the financial industry.
If you can stomach the bro-style presentation. The author conveys a much better picture on the circumstances at the time than typically dry textbooks or historical accounts.
https://artholes.podbean.com/e/caravaggio-ep-1-but-firsta-ta...
For comparison, this is the malloc/free implementation of the original UNIX. Also nice and tight C code.
https://warsus.github.io/lions-/all.html#line2522
Although this isn’t very efficient for today’s memory sizes.
Whereas in the 6 month old keynote the same Jeff says there is no plan for breaking changes and hence no 2.0 is planned.
So Julia will remain stable. And maybe we get interfaces (or rather traits) at some point in the 1.x release family.
I checked the usual places and did not find any information on 2.0 and an interface mechanism. Do you have a pointer?
Video recordings from the corona period (+ slides) are available here: https://www.youtube.com/playlist?list=PLdkTDauaUnQpzuOCZyUUZ...