Concert

by and with 26 Markov Monkeys

This concert is to become a model for the interplay of 26 Associative Arrays.

Oddly Influenced. 31 December 2023. podcast jpg

I had thought about arranging Markov Monkey processes in a Circle or in a Lineup, so to speak. See Symbol Board

Each process would start at one of the 26 List Indexcards (A-Z) in a frame marked as "SOURCE monkey" (cf. Scribble and Stream of Points, where I learned the "SOURCE point" and "LINEUP point" markup.).

The streams should converge in one point on a page similar to an Ophanim.

Konzert

On an index page, the process should prefer the breadth-first search (BFS) to the depth-first search (DFS) and start a DFS for each index entry, i.e. a Paragraph with link(s).

The 26 graphs should be merged and reduced to a simpler graph in the center of the Ophanim page ("LINEUP monkey"), which represents the answer that the program should compute.

I am thinking of a simple Markov chain with two states (A and B) in our state space. A = DFS ( depth-first search) and B = BFS (breadth-first search). See Markov Chains

The BFS should be preferred on one of the List Indexcards pages and a DFS process should be started for each list entry.

DFS should be preferred within an index entry context. See Associative Chaining

The frame on the Ophanim page with "LINEUP monkey" shows the answer, e.g. 42. What is the question?

Perhaps we can regard these monkeys as Cybords. DFS or BFS corresponds to high or low.

> "… and chance would have it Hear the Arithmetic Sum of both sources."

~

The second card above refers to 2 Single Rendering Trees. In the single rentering tree (SRT) seen from g**t**, twin Lepiter pages are created for the Lineup in f**W**.

A frame object is serialized to a f**W** HTML frame snippet on a federated wiki page with esm.html plus "SOURCE monkey" markup and starts a breadth first search (BFS) process on the list index card assigned to it.

The frame content is constantly updated and serialized live. See Live Serialization

We are dealing with 2 single rendering trees: one within g**t** and one within f**W**, connected by a card as a portal. See HOPP pattern and Object Has Two Public Billboards (requests/offers)