Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@samerfarha@mastodon.social
2025-11-06 16:17:25

This is the future liberals want:
ruv.is/english/2025-11-06-more

@vosje62@mastodon.nl
2026-01-05 20:39:34

Ofcom makes 'urgent contact' with X over concerns Grok AI can generate 'sexualised images of children' | Science, Climate & Tech News | Sky News
#Twitter

@grumpybozo@toad.social
2025-12-29 19:28:41

Any #FreeBSD sysadmins out there running #Bastille jails with multiple interfaces?
Or any sort of jail with multiple interfaces?
I was going to try out Bastille rather than old-fashioned manual "Thick" jail like the ones I’ve set up before because I've never done multiple interfac…

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.
bit.ly/3NiBX0r
📸 J.…

@grahamperrin@bsd.cafe
2025-12-24 12:34:13

pkgbase: all packages deleted without deleting FreeBSD.
pkg-unregister(8) is our friend.
pkg version 2.5.0 is something special.
A software reason to be jolly for a festive season.
Fa la la la la, la la, la, la.
#FreeBSD #pkg

@arXiv_csFL_bot@mastoxiv.page
2026-01-09 07:35:25

One-clock synthesis problems
S{\l}awomir Lasota, Mathieu Lehaut, Julie Parreaux, Rados{\l}aw Pi\'orkowski
arxiv.org/abs/2601.04902 arxiv.org/pdf/2601.04902 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

@lilmikesf@c.im
2025-11-19 21:10:41

#Federal monitor wants #SantaClara County held
in #contempt for purposefully dragging feet on mandated jail reforms.
Report finds “The county’s continued