Ex Machina [36 - 47]

(while in secret new machines produce new needs) [11]

Tesseract [62]

The cathedrals, the pillars, the halls. [64]

And believe that you see something. [47]

S↓E→3940414243444546474849505152535455
2832442444553444534
2944344213314465466
3041244444443234553
3112542444554444544
3252344544354245544
3323322444334154342
3443423123143443244
3541443433342234533
3641154443443334543
3753553325431454555
3823333433442333423
3904543433443433433
4040453435442355645
4153043332342355555
4242402324122443144
4323420234333344332
4444644014342554455
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