Top
Best
New

Posted by surprisetalk 4 days ago

Regex Chess: A 2-ply minimax chess engine in 84,688 regular expressions(nicholas.carlini.com)
119 points | 23 commentspage 2
neuroelectron 3 hours ago|
Previously posted: https://news.ycombinator.com/item?id=42619652
devanshp 4 hours ago||
This is absurd. I did not realize you could do nearly this much computation in regex.
tgv 2 hours ago||
It's not just regex. The regular expressions are used to select and perform an action. There's a loop around it with controls the stack. That has more power than the regex.
karlgkk 4 hours ago||
It’s turing complete so you could compile almost any language to regex. You might have to build a vm for some languages, also in regex. The point is, it’s regex all the way down.
Patryk27 2 hours ago||
Regular expressions are not Turing-complete.
0xffany 2 hours ago||
True in the CS Theory space, but most modern regex engines implement a few niceties which make their "regex" turing complete. https://blog.poisson.chat/posts/2024-06-18-turing-regex.html
casey2 1 hour ago|
Alternate title:

Compiling Python to a Branch-Free SIMD Virtual Machine via Extended Regular Expression String Rewriting