Ex Machina [29 - 15]

What you know does not matter, even if you knew. [45]

What you want is that, present or absent, [I]ts status is certain. [3]

Please be aware of these risks. [19]

As you forge links in this chain. [13]

“[T]here is no a priori improbability in the descent of conscious (and more than conscious) machines from those which now exist, except that which is suggested by the apparent absence of anything like a reproductive system in the mechanical kingdom. This absence however is only apparent, as I shall presently show.” [15]

S↓E→7891011121314151617181920212223
2154334322343314053
2244222333322331303
2344542323313242440
2454344431433424352
2532333434431442414
2644521234232242434
2744333323312344344
2824523334332453433
2965244543544333224
3044511234323141335
3144523323342443353
3254522323323252444
3343433433242331433
3443333322344313253
3543441212223244453
3644441223334253424
3754313434442342344
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