Ex Machina [45 - 24]

What you want is meaning, a difference between [I]ts presence and [I]ts absence. [24]

S↓E→1617181920212223242526272829303132
3742342344353342342
3822443324413323433
3942435253443354434
4023353444433113241
4123442414454133343
4243333233343331233
4323333431422233313
4443333254254453433
4534224143165542424
4634223243243442234
4734222143332332123
4833422313154344343
4931233233242231333
5031334334552234343
5133334233223343333
5222333322213334322
5332224242233222322
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