Viewing profile — pdobsan
pdobsan
HN member- Joined
- Tue, Feb 20, 2018, 10:21 PM UTC
- HN karma
- 37
- Public activity
- 20 items
- HN profile
- View on Hacker News ↗
About pdobsan
No profile information was provided.
Recent public activity
-
comment
Comment #44375552
These replies would be more useful if they included the subscription(s) cost.
-
comment
Comment #41468751
"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 ha…
- story
- comment
- story
-
comment
Comment #38828883
> 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 re…
-
comment
Comment #35726496
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 crede…
-
comment
Comment #33814782
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 th…
-
comment
Comment #22270201
Working with GraphQL.
-
comment
Comment #21083982
Actually, they do "build cities" as it was recently discovered: https://qz.com/1077632/octlantis-is-a-just-discovered-underw...
-
comment
Comment #20658160
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 com…
-
comment
Comment #19956424
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 isom…
-
comment
Comment #19955766
> 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 certainl…
-
comment
Comment #19955434
SAT, its extensions and SMT solvers are heavily used in bioinformatics. For example in genetics and for protein folding problems.
-
comment
Comment #19954983
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 s…
-
comment
Comment #19885459
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 …
-
comment
Comment #19156050
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 T…
-
comment
Comment #18035065
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 a…
-
comment
Comment #17177905
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.
-
comment
Comment #17045820
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.