j-pb

21 ms·

271.
by j-pb 3y ago
Obviously by being thick skinned and competent enough to somehow survive in our very[0] sexist industry. 0: The horrid comments in this thread are provided as evidence A.
272.
by j-pb 3y ago
TerminusDB also spports branching and merging. [1] 1: https://terminusdb.com/
273.
by j-pb 3y ago
Sorting the files can be a logarithmic operation with constant memory. A great candidate would know that this is a log-linear operation O(n*log(n)), not a logarithmic one O(log(n).
274.
by j-pb 3y ago
Yeah, It's not that I don't see the advantages. I wish that there was a way to get our cake and eat it too. Maybe we can dependently typed eat our way through to the other end, where while we do have monomorphization errors, havi
275.
by j-pb 3y ago
There a million ways your code can break downstream dependencies, generic code is just one of them. Breaking stuff when you change things is just in the nature of it, which is why not changing APIs is so important. But I'd rather have
276.
by j-pb 3y ago
> To be fair go has never used llvm and was delivered in less that 50 years. And if Zig was a google project instead of a 3 person show, I'd be far more inclined to believe that they can pull this off. But as previously said, the cu
277.
by j-pb 3y ago
Priorities. The team is too focused on global maxima, speed and reinventing compiler design at the cost of a reference implementation that's fundamentally broken, and too complex to fix. This results in miscompilations, broken buildins
278.
by j-pb 3y ago
Focus on the compile error story. In particular, the design should avoid anything that leads to post-monomorphization errors. This is the single biggest mistake of Rust imho. I don't care in which compiler pass an error occurs
279.
by j-pb 3y ago
The thing is though that a lot of these problems are NP-Hard, so you're often better of with a general problem solver that knows tricks how to optimise the search for the solution, than something hard-coded where it's impractical
280.
by j-pb 3y ago
Happy to see progress on this front, but very disappointed that the Datalog based checker is not used. Declarative formulations of these problems are much easier to maintain, verify, and spec than a imperative (re)implementation.
281.
by j-pb 3y ago
It's absolutely bonkers that TLA+ struggles with this, given that a system is eventually consistent IFF it is logically monotonic (CALM) [1]. This also doesn't make intuitive sense to me. Model checking should be easier for monoto
282.
by j-pb 3y ago
Exactly. Turing postulated this more than half a century ago. It's weird that people are still surprised of the ethical consequences of the Turing-test, as if it were some checkbox to tick or trophy to win, instead of it being a profou
283.
by j-pb 3y ago
I feel like the much bigger risk is captured by the Star Trek: The Next Generation episode "The Measure Of A Man" and the Orvilles Kaylon: That we accidentally create a sentient race of beings that are bred into slavery. It would
284.
by j-pb 3y ago
Ram on a different machine via ethernet has lower latency than spinning disks in the same machine.
285.
by j-pb 3y ago
As someone who does a lot of unsafe rust, including tagged pointer foo, I strongly disagree. If anything I want more explicit control, alleviated with an even more expressive type system. Ideally rusts type system would just be a prolog var
286.
by j-pb 3y ago
I get what you're trying to say, that in Prolog you are able to lookup structures by their shape, and not by some pre-defined path, as in other languages, so you can do both `edge(1, A)` and `edge(A, 1)`. But the graph in your example
287.
by j-pb 3y ago
This resoning is a prime example of cognitive dissonance at work. If A is true then B is true, but B is bad and doesn't align with how I want to see the world or myself, therefore A must be false. LLM fulfil all the requirements that T
288.
by j-pb 3y ago
Having a wired connection to a wireless breadboard seems inconsistent. In for the penny in for the pound: Drum power connection + Bluetooth connectivity only!
289.
by j-pb 3y ago
But will it be correct and not encounter a compiler bug? ;P
290.
by j-pb 3y ago
The majority of papers are also garbage that add nothing to scientific progress, and are just there to satisfy some departments publication or project deliverable quotas.
291.
by j-pb 3y ago
"Semantic web for the working ontologist" by Dean Allemang and James Hendler might be a good starter if you want to go proper Rdf/RDFS/OWL. TBH I would probably take a look at terminusDB though. They do things a bit diff
292.
by j-pb 3y ago
I feel like RDF/TripleStores and ECS both offer nice solutions to this problem. With both you kinda separate your application into a control-plane (functions and other code) and a data-plane (in-memory database). With the control-plane
293.
by j-pb 3y ago
> Oh of course they tried to build a high-level CPU too. Still a terrible idea decades later: I'll bite. A high-level CPU doesn't nessecarily have to add stuff, sometimes a high-level CPU does less because the tight integrati
294.
by j-pb 3y ago
Düsseldof and now my home state of Bremen (the smallest city state of germany) have recently asked their state owned public transport company to no longer bring these cases to the police.[1] Sadly it's federal law so our local governme
295.
by j-pb 3y ago
The real gem is the scientific article hidden in the pubsci article: Gabriella E. Smith, Philippe A. Chouinard, Sarah-Elizabeth Byosiere, If I fits I sits: A citizen science investigation into illusory contour susceptibility in domestic cat
296.
by j-pb 3y ago
Not sure if a joke referencing ColorForth. If not, ColorForth.[1] 1: https://en.m.wikipedia.org/wiki/ColorForth
297.
by j-pb 3y ago
The ISS is a symbol of international peace and collaboration. In a time where tensions are increasing and everybody abandons nuclear disarmament treaties, it seems like a good idea to keep it as a reminder that an end of the cold war was po
298.
by j-pb 3y ago
Worst Case Optimal Join Algorithms. Tecnically they started in 2008 with the AGM bound, but most meaningfull algorithms have been developed after 2012.
299.
by j-pb 3y ago
https://arxiv.org/abs/2309.10668
300.
by j-pb 3y ago
Viktor Leis's working group consistently produces interesting fundamental database research. AdaptiveRadixTries, HeightOptimisedTrees, and the Umbra database system are all done by them.

More ›