This is the future liberals want:
https://www.ruv.is/english/2025-11-06-more-than-90-varieties-of-jol-beer-available-this-year-458280/
Ofcom makes 'urgent contact' with X over concerns Grok AI can generate 'sexualised images of children' | Science, Climate & Tech News | Sky News
#Twitter
Proposition 36, approved by voters last year, gave prosecutors the ability to charge people convicted of various third-time drug offenses with a so-called
treatment-mandated felony
– a choice between behavioral health treatment or up to three years in jail or prison.
https://bit.ly/3NiBX0r
📸 J.…
One-clock synthesis problems
S{\l}awomir Lasota, Mathieu Lehaut, Julie Parreaux, Rados{\l}aw Pi\'orkowski
https://arxiv.org/abs/2601.04902 https://arxiv.org/pdf/2601.04902 https://arxiv.org/html/2601.04902
arXiv:2601.04902v1 Announce Type: new
Abstract: We study a generalisation of B\"uchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton, and one of the players can elapse time. We perform a systematic study of synthesis problems in all variants of timed games, depending on which player's winning condition is specified, and which player's strategy (or controller, a finite-memory strategy) is sought. As our main result we prove ubiquitous undecidability in all the variants, both for strategy and controller synthesis, already for winning conditions specified by one-clock automata. This strengthens and generalises previously known undecidability results. We also fully characterise those cases where finite memory is sufficient to win, namely existence of a strategy implies existence of a controller. All our results are stated in the timed setting, while analogous results hold in the data setting where one-clock automata are replaced by one-register ones.
toXiv_bot_toot
#Federal monitor wants #SantaClara County held
in #contempt for purposefully dragging feet on mandated jail reforms.
Report finds “The county’s continued