❄️🦊 @icefox@octodon.social

@Azure That sounds like a pretty good description of computation as it currently is...

@pbuyle Scuttlebutt in general looks awesome but maybe a little impractical. Need to play with it more. But a merkle dag/tree of messages is a very interesting and useful sort of structure for all sorts of distributed communication.

@Azure That is probably a very good way to view it!

Though I suspect that if it makes extropians happy they are extropians who have no conception of how difficult it is to do anything terribly complicated with a Turing-equivalent machine...

@Azure I knew that there was a hierarchy of expressiveness but didn't know it could be summed up so simply.

What does one get when one gives a state machine *three* stacks? (No increase in expressiveness, I'm sure, given that a Turing machien can represent any number of stacks you want it to... but *why*?)

@dasyatidprime Which means that we should (soon?) be able to target WebAssembly without having to faff about over-much with emscripten.

@dasyatidprime Yep. I didn't write it, but there's a crate called `winit` that does cross-platform window creation and event stuff. It's recently gotten mature enough I feel reasonably safe using it for ggez.

@dasyatidprime I never got that far! And all the parser theory I learned (or at least that I remember) is from reading books about the compilers. They go *fairly* deep into the theory but that one bit never seems to have struck me before now.

Besides, being a well-documented epiphany doesn't make it less of an epiphany! :-P

I don't know if it's a coincidence that the math behind models of computation and the programs we create to parse human (and machine) languages are so closely related, but it's a compelling coincidence even so.

Also, https://matklad.github.io/2018/06/06/modern-parser-generator.html is worth a read even if you're only kind of interested in parsers. There's epiphanies in it. Like:

Regular languages (regex's) are state machines with a fixed memory space.
Full Turing machine languages are state machines with two stacks of memory space (moving the Tape is popping an item from one stack and pushing it to the other).
Context-free languages are exactly in the middle: they're state machines with one stack.

I don't know what it means but it's deep.

In other news, the pure #rust version of ggez seems to be working quite nicely. Fare well SDL2! Many badmouth you, but you have served us well. Nonetheless, we are proud to have outgrown you! ❤

#gamedev

Whew, frontend web crap is *hard work*.

I really probably shouldn't make ggez releases purely because I'm sick of dealing with coordinate system bugs and want to get on with life, but...

ggez 0.4.3 released, see full announcement here:

https://www.reddit.com/r/rust_gamedev/comments/8p62z4/ggez_043_released/

#rust #gamedev

@cypnk Back when we didn't have the vacuum tubes to waste on "ergonomics".

@a_character I sympathize, but it appears it's officially unassigned?

I am also forced to evilly snicker at all the people who say things like "so what if gitlab is bloated just throw more RAM at it". Just a little bit.

Like, I totally sympathize, but how much time do you really want Gitlab to spend being crippled by its own success?

We should train a machine learning algorithm to try to auto-CW toots.