Ex Machina [36 - 40]

Improvements are necessary. Conceived and carried. [40]

S↓E→3233343536373839404142434445464748
2834424313244244455
2945245364434421331
3022431434124444444
3134424341254244455
3203422445234454435
3340342352332244433
3444033254342312314
3524303434144343334
3625420534115444344
3724424055355332543
3834334302333343344
3944334350454343344
4014533424045343544
4135534445304333234
4234323444240232412
4332233332342023433
4435335164464401434
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