Ex Machina [22 - 36]

and recombining [62]

The possibility of parallel functions. [50]

The poem is not written by machines. [36]

S↓E→2829303132333435363738394041424344
1432333232434435332
1533242213234423342
1614434433442435434
1733233242214423424
1825433443433435444
1932333332444425123
2034143353254423445
2143414443545236234
2233232442334421322
2324342142343324335
2443344313435545342
2544343342324332333
2634133133134322334
2722444442433535433
2804433442431324424
2950434524536443442
3024032243143412444
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