iiinova — where your digital self keeps evolving

LR @lr.duangle.com · 25/09/2026

The Copilot+ PC brand is dead: Microsoft and PC makers quietly pull back on tarnished Windows 11 AI PC branding www.windowscentral.com/microsoft/wi...

030

LR @lr.duangle.com · 20/09/2026

assassin's creed shadows is teaching me one thing: the medieval japanese loved their thicc roofs they put thicc roofs on anything, even street lamps

010

LR @lr.duangle.com · 11/09/2026

the discourse on tv today

111

LR @lr.duangle.com · 03/09/2026

i passed your question on to dr. sloppy who searched the web and then guessed you're on 500mg of caffeine which is not lethal just unpleasant. furthermore:

200

LR @lr.duangle.com · 21/08/2026

*catching up on debate* i guess i'm "spreadsheet people". look i even make music with spreadsheets

240

LR @lr.duangle.com · 21/08/2026

tried to fix copyright issues of a famous meme pic at great ethical cost

140

LR @lr.duangle.com · 19/08/2026

hehe real jack johnson vs john jackson moment.

The state’s unusual nonpartisan primary pits incumbent Republican Senator Dan S. Sullivan against Democratic challenger Mary Peltola and another Republican with a similar name, Dan J. Sullivan. Trump has accused Dan J. Sullivan of trying to confuse voters and dilute the Republican vote, and his Justice Department has launched an investigation. Dan J. Sullivan, a former schoolteacher, says that is not his intent.

010

LR @lr.duangle.com · 13/08/2026

finally got to use this bad boy today

030

LR @lr.duangle.com · 07/08/2026

"has genetical engineering gone too far?" i argue it hasn't gone far enough find attached below, my modest proposal for a growable carriage

031

LR @lr.duangle.com · 04/08/2026

@speckbrummsel.bsky.social hänge bei level 42. nimmt man die kirsche, steckt man unten fest, mit oder ohne trauben. die trauben kann man scheinbar nicht zuerst nehmen.

110

LR @lr.duangle.com · 24/07/2026

typical bollocks AI response 😠

search term: how to reincarnate Stanisław Lem with witchcraft

AI Overview:

Reincarnating the Polish science fiction author Stanisław Lem using witchcraft is impossible because magic cannot override the laws of biology and physics. Witches and spellwork cannot bring back the dead.

151

LR @lr.duangle.com · 23/07/2026

Describe your bluesky account with a single image

010

LR @lr.duangle.com · 23/07/2026

reading this in stephen colberts voice

010

LR @lr.duangle.com · 19/07/2026

zwei deppen ein gedanke

110

LR @lr.duangle.com · 17/07/2026

ist es... ja, er ist es

010

LR @lr.duangle.com · 12/07/2026

okay i've been lucky. two uses, with modifications.

000

LR @lr.duangle.com · 12/07/2026

built for this popcorn transport. no other practical use.

100

LR @lr.duangle.com · 10/07/2026

oh no no please no

100

LR @lr.duangle.com · 10/07/2026

so glad this is unrealistically stable right now

100

LR @lr.duangle.com · 10/07/2026

i'm the michelangelo of transport

100

LR @lr.duangle.com · 04/07/2026

another example of a classical application of datalog that takes many more lines to implement in an imperative language. it's slightly more verbose but still compact in comparison.

type ID : s32
set edge ID ID
set path ID ID
queue next_path ID ID

then edge ::
0 :: 1 2
1 3
3 4
2 4
4 :: 5 6

# rules for transitive closure
and # init path from edge
edge ?x ?y
then path x y

and # discover transitive closures
let x y z
# chained sub-products are evaluated disjunctively
and
new path x y # for every new insertion in path
path y z # for every edge starting at y
and
new path y z
path x y # for every edge ending in y
then next_path x z # add to queue
and
new next_path ?a ?b # work off queue
cue path a b # `cue` is like `then` but applies to next iteration

010

LR @lr.duangle.com · 04/07/2026

@mmalex.bsky.social here's fizzbuzz written in nudl (that's the name of my language)

$# fizzbuzz evaluated in single top level iteration using import reduce # for sum_option # table of type sum_option and name "output", with one column of type string tables are container abstractions and the "vertices" of our data flow graph. sum_option output string # declare external C function; rawstring is `const char *` extern fn puts rawstring -> s32 # product that is evaluated once `out` is complete, see next block for more details about products. and # declare variable `str` in-place with `?` prefix output ?str _ = puts (str : rawstring) # cast str to rawstring before printing it assert str == S"1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n" # products are how we transfer data between tables. they are the "edges" of our data flow graph. specifically, each product is a hyperedge, so our graph is bipartite, with two vertex types: tables and products. and ?i = range 1 16 # generate numbers from i >= 1 to i < 16 # for each i: fold and # open a local fixed point iterative loop here we only have one product which completes in one iteration, so the fold section only serves to merge control flow. try # disjunctive product that may yield zero completions or # products conceptually evaluated in parallel and i % 3 == 0 then output S"Fizz" and i % 5 == 0 then output S"Buzz" else # execute this product if try has no completions then output (format "{}" i) # once for each i then output S"\n"$