Ex Machina [25 - 39]

the paper prepared [2]

The book that you read, seeking something. [60]

What you want is to proceed, in some fashion: through the book, through the poem, through the world: and for this procession to seem motivated, to possess or develop meaning. [39]

S↓E→3132333435363738394041424344454647
1733242214423424355
1833443433435444444
1933332444425123222
2043353254423445455
2114443545236234333
2232442334421322312
2342142343324335443
2444313435545342222
2543342324332333423
2633133134322334444
2744442433535433243
2833442431324424445
2934524536443442133
3032243143412444444
3103442434125424445
3240342244523445443
3334034235233224443
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