Dynamic Instruction Set Computing
So, semantic triples as machine code...
Every object and link has an ID (which will be null if it's transient). Every property has an ID. The value of a property may be an object or link, transient (an object with a null ID), a constant (enum), or an opaque blob. There's a surprisingly small number of necessary operations to implement, a unique signature for every possible operation, and a rational default for unimplemented operations
Once on the server, ActivityPub is an abstract syntax tree with symbols defined by an RDF and the type of the root element extends Activity. To the machine, there's a lisp procedure under all those search terms
The type of Activity and the context constitute a mnemonic that can be used as the basis for determining the signature of an operation and assigning an op code
The VM looks up the op code and performs the operations indicated as described by its "microcode"
It's possible to create a document format and output device for the VM such that new op codes could be defined in the assembler table and the behaviors described for op code lookup, modifying the behavior of the VM while it is in operation, e.g. improving protocol coverage, implementing extensions, or fixing processing bugs
Congratulations. It's a DISC ISA 😎
Officially endorsed by @Gargron as a joke instance (along with freedom.horse). Things that make banana.dog unique as an instance.
- Federates with TOR servers
- Stays up to date, often running newest mastodon code
- Unique color scheme
- Strictly enforced rules
- A BananaDogInc company. Visit our other sites sites including betaMax.video, psychicdebugging and gonnaroll