Ex Machina [31 - 34]

An ethics in which the artist is perceived as enemy. [39]

I am going to persist
in this evasion. [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]

“Physiologically, man in the normal use of technology [...] is perpetually modified by it and in turn finds ever new ways of modifying his technology.” [34]

S↓E→2627282930313233343536373839404142
2343243421423433243
2444433443134355453
2523443433423243323
2603341331331343223
2730224444424335354
2833044334424313244
2954504345245364434
3012240322431434124
3133354034424341254
3223351403422445234
3333432340342352332
3434432344033254342
3531233324303434144
3642243325420534115
3733423424424055355
3833234334334302333
3933544344334350454
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