Ex Machina [43 - 41]

As the book reads you, its discrete parts connect, linking to produce some variant poem. [60]

What you want from the world is for it to exist beyond your death, to provide context. [25]

the words [22]

combining [41]

S↓E→3334353637383940414243444546474849
3543034341443433342
3654205341154443443
3744240553553325431
3843343023333433442
3943343504543433443
4045334240453435442
4155344453043332342
4243234442402324122
4322333323420234333
4453351644644014342
4542452534534103333
4643332543424120133
4734224432313323033
4841343553233232203
4933132442442214320
5032312452243344353
5143343433422212223
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