pdobsan

4 ms·

1.
by pdobsan 1y ago
These replies would be more useful if they included the subscription(s) cost.
2.
Jujutsu Strategies(reasonablypolymorphic.com)
1 points by pdobsan 2y ago|1 comments
3.
by pdobsan 2y ago
"Today I want to talk about jujutsu, aka jj, which describes itself as being “a Git-compatible VCS that is both simple and powerful”. This is selling itself short. Picking up jj has been the best change I’ve made to my developer workfl
4.
Exotic black holes could be a byproduct of dark matter(news.mit.edu)
6 points by pdobsan 2y ago|0 comments
5.
by pdobsan 3y ago
> If you're trying to teach people about the scales of space, I think you need something humanly navigable The Somerset Space Walk [1] seems to be a very nice candidate for your requirements. [1] https://en.wikipedia.org
6.
by pdobsan 3y ago
A while ago I wrote a small utility mailctl [1] to provide IMAP/SMTP clients (like msmtp, fdm, isync, mutt, etc.) with the capabilities of renewal and authorization of OAuth2 credentials. mailctl acts as a kind of smart password manage
7.
by pdobsan 4y ago
There is a pending pull request partially addressing this: https://github.com/helix-editor/helix/pull/4204 It would be nice to have a comprehensive and convincing explanation in the documentation which
8.
by pdobsan 7y ago
Working with GraphQL.
9.
by pdobsan 7y ago
Actually, they do "build cities" as it was recently discovered: https://qz.com/1077632/octlantis-is-a-just-discovered-underw...
10.
by pdobsan 7y ago
See this article https://www.sciencealert.com/new-study-brings-receipts-to-de... which is an excellent overview of Tenkanen's paper the subject of this thread. It also puts the competing ideas about cosmic inflation in
11.
by pdobsan 7y ago
Not sure what exactly you mean by that but finding symmetries in a graph that is determining its automorphism group is not a simple problem. It is closely related to the graph isomorphism problem, about which we don't currently know wh
12.
by pdobsan 7y ago
> The overhead of searching for symmetries and the exposition of dynamic clauses, make it a difficult trade off against the ruthless efficiency of traditional CDCL That is certainly true. However, once all the other components have been
13.
by pdobsan 7y ago
SAT, its extensions and SMT solvers are heavily used in bioinformatics. For example in genetics and for protein folding problems.
14.
by pdobsan 7y ago
The article does not mention it but "symmetry breaking", a technique of exploiting symmetry to prune the search tree, can also be an important component of modern SAT solvers. In some sense one cannot do better than avoiding all s
15.
by pdobsan 7y ago
Pijul ( https://pijul.org/ ) is based on a categorical theory of patches ( https://arxiv.org/abs/1311.3903 ). It is similar to Darcs but written in Rust. They claim that Pijul has solved the exponential me
16.
by pdobsan 8y ago
I am not aware of such a (comprehensive) list but if it existed it would be a very long one for such a relatively little known field. The few survey papers on Computational Group Theory (CGT) focus mainly on applications in pure mathematics
17.
by pdobsan 8y ago
The 2016 survey: https://arxiv.org/pdf/1612.00676.pdf Both surveys are fascinating reads. They clearly give a sense that despite of the spectacular success of QM how far we still are from the final word in that field.
18.
by pdobsan 8y ago
Not exactly what you have asked for but you can find the LaTeX sources of the book at https://github.com/ds26gte/tyscheme with instructions of building a PDF version.
19.
by pdobsan 8y ago
There is already a well established Gnome project with the same name: http://www.glom.org It is a GTK+ front-end to PostgreSQL, similar to Microsoft Access.