Ex Machina [51 - 32]

The poem is not written by the author. [52]

Minds more powerful than rooms of computers. [62]

The universe as one machine among many. [32]

S↓E→2425262728293031323334353637383940
4342223331322333323
4425445343353351644
4516554242442452534
4624344223443332543
4733233212334224432
4815434434341343553
4924223133333132442
5055223434332312452
5122334333343343433
5221333432232333432
5323322232233143331
5432332232333344223
5524443344432354334
5651333533244333442
5742223332332234323
5832332333343242223
5925453233453443444
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