Ex Machina [62 - 11]

The computation of parallel problems, the differing solutions. [11]

S↓E→345678910111213141516171819
4832435433343243342
4921434422232333123
5042245453233413133
5124453224344323333
5233343334233322233
5312343423232223222
5433351334323422344
5533342124233132313
5643344344233432233
5723352144333313333
5833141233222222324
5924555414233342313
6013343234332223222
6113444323343233322
6233244443122321224
6333554344454455243
6423444333344354233
Full Pathfinding Graph

Colophon

This online application automatically generates rule-abiding nonlinear readings of Ex Machina, as originally written by Jonathan Ball, whose first print edition was published by Book*Hug in 02009.

This literary stress-test assists in performing a qualitative analysis under the following hypothesis: nonlinear constructions of Ex Machina are semantically and poetically inferior to the first published linear construction. The methodology is adjustable due to lack of instruction in the original text, but the current simulation available is limited due to media porting instability. (In this case, a textuality deficiency with regards to physical media from the text's self-referential nature of itself being a printed and bounded book.)

The equivalent null-hypothesis would therefore state that rule-abiding nonlinear structures would make an equal or greater amount of sense as a linear reading of the original manuscript.

The methodology for this experiment uses an improvisation upon Edsger Dijkstra's graph-based pathfinding algorithm, unweighted. It accepts two parameters before running: starting location and desired ending location. It will then search for the shortest possible path between these two subsets. (Some possible sets of the same shortest length with different contents may exist.)


Return to Literature Index