nemoniac

LibreOffice has Python integration.

https://help.libreoffice.org/latest/en-US/text/sbasic/python...

See woman-mode in Emacs

https://www.gnu.org/software/emacs/manual/html_mono/woman.ht...

"until recently, Jupyter notebooks were the only programming environment that let you see your data while you worked on it."

This is false. Org-mode has had this functionality for over two decades.

https://orgmode.org/

That's quite a time investment; about 3 months on a full-time basis.

One detail intrigued me. The author has a PhD in Informatics but "had never used any programmers’ editor other than Notepad++". He credits being able to touch-type for some of his efficiency and went about learning a swathe of tools including Emacs and several diagramming languages. These diagram files and the OrgMode file are a valuable reference in themselves.

Tsja, zekerheid is a cognate for security. "Zeker" from Latin "Sēcūrus".

> This is a common question :)

It'd be really great if you could put your answer in the readme. It was the first question that came to my mind when looking at your project.

I'm looking forward to trying out schemesh!

There already exists a tool called nping. It comes with nmap.

https://nmap.org/nping/

There has been quite some research on finding, in layman's terms, where the difficult instances of an NP-complete problem are.

What it comes down to is that there are phase transitions in computational systems that depend on how constrained the problem is.

Consider a sudoku puzzle. If the board is almost empty of numbers then it's easy to solve. If the board is almost full of numbers it's easy to solve. But there's some critical amount of numbers filled in (say half of them) that makes the sudoko most difficult to solve. That's where the phase transition is.

The notion of a phase transition comes from thermodynamics where ice becomes water becomes gas.

Here's an early paper on phase transition is AI.

https://www.sciencedirect.com/science/article/pii/0004370287...

Here's a later one on phase transitions for the satisfiability problem (SAT).

https://homepages.inf.ed.ac.uk/rbf/MY_DAI_OLD_FTP/rp679.pdf

Check the first comment on the linked page for counterpoint.

Also note that copyright laws exist outside the US and may differ.

Not only that, DeepSeek "thinks" in English!

When I interact with it by asking it a question in Spanish, the parts between the <think> ... </think> are in English before it goes on to answer in Spanish.

Give it a try in your favourite language.

I went on to ask it if it "thinks" in English, Spanish or Chinese but it just gives the pat answer that, being an LLM, it doesn't think in any language.

Fascinating blog post. Having said that, it may seem like nitpicking but I have to take issue with the point about recursion, which is often far too easily blamed for inefficiency.

The blog post mentions it as one of the reasons for the inefficiency of the conventional algorithm.

A glance at the algorithm shows that the recursion in question is a tail call. This means that any overhead can be readily eliminated using a technique known for nearly fifty years already.

Steele, Guy Lewis (1977). "Debunking the "expensive procedure call" myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO". Proceedings of the 1977 annual conference on - ACM '77.

gptel can do this already with over 20 models.

Costs nothing beyond your subscriptions to the individual models.

https://github.com/karthink/gptel

The author shows it with 4 models at once in this demo video:

https://www.youtube.com/watch?v=bsRnh_brggM&t=853s

If you're looking for robust, nonfree packages for Guix, you can find them here:

https://github.com/nonguix/nonguix

Some have voiced concerns about Bluesky using trackers.

https://pnw.zone/@BlurryBitsPhoto/113804648365475726

Or save yourself $22: https://www.youtube.com/watch?v=bR5G1HFXY1U

I wonder what David Graeber would have made of this. Would he have said that the staff to be reduced were doing "bullshit jobs" anyway? Or is there even a significant overlap between the reduced staff and the bullshit jobs?

https://en.wikipedia.org/wiki/Bullshit_Jobs

Click through to "For users".

Python source code available at

www.pqconnect.net/pqconnect-1.2.1.tar.gz

Well that's a bit snarky but there is an element of truth to it. I'm reminded of the first line of the old spec for the Scheme programming language.

"Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary."

https://people.csail.mit.edu/jaffer/r4rs_2.html#SEC2

And here it is in Racket or Scheme:

    (define (apply a b)
      (cond ((null? a) (list b))
            ((procedure? a) (cons (car a) b))
            ((null? (car a)) (cdr a))
            ((procedure? (car a)) (apply (apply (caar a) b) (apply (cdr a) b)))
            ((null? b) (caar a))
            ((procedure? b) (apply (cdar a) (car b)))
            (else (apply (apply (cdr a) (car b)) (cdr b)))))
    
    (define t-false null)
    (define t-true (list null))
    (define t-not (cons (cons (list null) (cons null null)) null))
    
    (apply t-not t-false)
    (apply t-not t-true)

Leaf is null, Stem is list and Fork is cons.

“I hated every minute of training, but I said, 'Don't quit. Suffer now and live the rest of your life as a champion'.” ― Muhammad Ali

You could argue that this is not merely adding syntax, but also adding the associated semantics.

Anyway, if you found this interesting, you might enjoy Eli Bendersky's blog post from nearly 15 years ago where he adds an "until ... do" statement to Python.

https://eli.thegreenplace.net/2010/06/30/python-internals-ad...

It might interest HN readers that Donald Knuth (of The Art of Computer Programming fame, among others) enjoys taking photos of yellow, diamond-shaped road signs. He has quite a collection!

https://cs.stanford.edu/~knuth/diamondsigns/list.html

There are several straightforward ways to do this without needing Tree-sitter or Jedi.

Here are two approaches in Emacs.

https://emacs.stackexchange.com/a/69571

https://rigsomelight.com/2010/02/14/emacs-interactively-find...

You can use rlwrap to wrap many command-line commands with readline. It is my single de-facto standard line editing system.

Roughly rhymes with the "vu" in "Déjà vu"

Could someone point to a description of how the passkey protocol actually works? I mean for example at the level of, here's how you would implement it using a crypto library in Python or some other language.

“We could prove our innocence by disclosing the details, if only we could remember them”, Jerry Solinas, NSA, page 18.

Emacs has two packages called rx and xr. They allow you to write regexes in an sexp syntax and translate between that and conventional regex syntax. Furthermore you can define regex snippets and compose them into new ones. This more than anything can give you a handle on how a regex is composed.

For example

  "\\`\\(?:[^^]\\|\\^\\(?: \\*\\|\\[\\)\\)"

can be written as

  (: bos 
     (| (not (in "^"))
        (: "^"
           (| " *" "["))))

Emacs also has other features to highlight matches and groups to help understand regexes better.

https://www.emacswiki.org/emacs/Rx_Notation https://github.com/mattiase/xr https://www.emacswiki.org/emacs/RegularExpression

It's worth noting that it's licensed AGPL so the source code is open and available. Arguably this is necessary for a fully verifiable election system. Or is there some kind of zero knowledge approach to it?

Wait, "between Finland and Sverige"?!

Why not "between Suomi and Sverige"?

Or "between Finland and Sweden"?

Is it because Åland is mostly Swedish speaking that "Finland" gets written in English and "Sverig" gets written in Swedish?