The following is a translation of F. Laruelle’s Introduction to Machines textuelles (Pais: Seuil, 1976), pp. 9-19, by Taylor Adkins, 9/1/13.
Introduction to Textual Machines: Deconstruction and Libido of Writing
The text, well, it doesn’t send word [s’envoie pas dire], but one can always say [dire] something about it.
Thus I am attempting to simultaneously guide an analysis of deconstruction’s techniques and a displacement of their problematics onto neighboring positions, about which I’m hoping that their neighborhood, in order to have some relation to topology, is neither good nor bad.
Which positions? Those which are implicated, not manifestly but latently, in “Nietzsche-thought”, or in the esoteric problematics of the Eternal return and the Will to power, which I shall call generalized repetition and intensive libido respectively. At the risk of seeming to elicit deconstruction’s virulence and facing the perils of an ideological regression, I am attempting to relate deconstruction to a principle of functionality a) that transforms it into a libidinal process of textual production; b) that pretends to reprise, even activate, effects-of-deconstruction on its behalf.
The following is a revision and correction of a preliminary draft drawn up by my friend Chris Eby several years ago. Since he undertook the task for the sheer pleasure of it, it’s state on Scribd cried out for a new edition. I have taken the liberty of reworking the essay in its entirety, so now all problems with the translation rest on my shoulders!
The Transcendental Computer
A Non-Philosophical Utopia
Translated by Taylor Adkins and Chris Eby
The unified theory of thought and computing [calcul], a unification in-the-last-identity, is a task facing every encyclopedic mind (Morin, Serres). It is also the theme of the transcendental computer (TC), of a machine that would have a transcendental relation to philosophy in its entirety and would therefore be able to compute-think the blendings of thought and computing according to a “unified” mode, such as, for example, a transcendental arithmetic like Platonism or any other combination of these prevalent terms in philosophy and computing. Beforehand, a prejudicial question concerning the degree of non-philosophy’s automaticity should be dealt with. In this sense, what follows is an attempt at the limits of the theme of a transcendental computer.