Ex Machina [44 - 12]

Tell me what you see. [45]

What you want is that, present or absent, [I]ts status is certain. [3]

Acknowledge the potential for failure. [18]

Concurrent Read Concurrent Write [11]

Tesseract [12]

S↓E→4567891011121314151617181920
3631444441223334253
3723254313434442342
3834413443234222443
3934543444212242435
4022435433434423353
4124355333434423442
4234443333433343333
4322423433333123333
4434354224543543333
4534465133432434224
4644443133432434223
4733332222332434222
4824354333432433422
4914344222323331233
5022454532334131334
5144532243443233334
5233433342333222333
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