Tootfinder

"‘It’s cheap but it’s not disposable’: why fast tech is a growing waste problem"
#Technology #EWaste

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
Eike Neumann
https://arxiv.org/abs/2506.21481 https://

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial decision method for this problem which is complete in the sense that its halting set contains the halting set of all sound partial decision methods for the problem. Equivalently, our decision method terminates on all problem instances whose answer is robust under a…

Micheal has cred, owing to a11ysupport.io:
https://bsky.app/profile/mfairchild365.bsky.social/post/3lpugshbmtk2o
But this other effort, IMO, is not the same nor as useful:

Important thread on BlueSky from Elliot Higgins on misinformation.
#misinformation…

SpaceX kommt nicht an Starship-Trümmer heran
Nach der Explosion einer Starship-Rakete in Texas beklagt SpaceX Probleme bei der Bergung von Trümmern. Mexikos Präsidentin droht mit juristischen Konsequenzen.
https://…

A Lebesgue variant of the additive square problem
Ingrid Vukusic
https://arxiv.org/abs/2506.21200 https://arxiv.org/pdf/2506.21200

A Lebesgue variant of the additive square problem
The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In this note we solve a Lebesgue integral variant of the problem. The proof is based on Lebesgue's density theorem.

LSD — My Problem Child
#Psychiatry

Timed Prediction Problem for Sandpile Models
Pablo Concha-Vega (AMU, LIS), K\'evin Perrot (AMU, LIS)
https://arxiv.org/abs/2506.21084 https://

Timed Prediction Problem for Sandpile Models
We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks whether a cell q will eventually become unstable after adding a grain at cell p from a given configuration. The prediction problem has been shown to be P-complete in several settings, including for subsets of the Moore neighborhood, but its complexity for the von Neumann neighborhood remains open. In a previous work, w…

It seems @… is not active on Masto, so…
https://bsky.app/profile/mfairchild365.bsky.social/post/3lpugshbmtk2o

IGF25: Diktatoren und Demokraten im globalen Süden als Kunden von Spyware
Spyware wie Pegasus von der NSO-Group wird zunehmend ein politisches Problem. Das war eine der Erkenntnisse des Internet Governance Forums in Norwegen.