Publication 5561

Villalobos M. & Dewhurst J. (2018) Enactive autonomy in computational systems. Synthese 195(5): 1891–1908. Fulltext at http://cepa.info/5561
In this paper we will demonstrate that a computational system can meet the criteria for autonomy laid down by classical enactivism. The two criteria that we will focus on are operational closure and structural determinism, and we will show that both can be applied to a basic example of a physically instantiated Turing machine. We will also address the question of precariousness, and briefly suggest that a precarious Turing machine could be designed. Our aim in this paper is to challenge the assumption that computational systems are necessarily heteronomous systems, to try and motivate in enactivism a more nuanced and less rigid conception of computational systems, and to demonstrate to computational theorists that they might find some interesting material within the enactivist tradition, despite its historical hostility towards computationalism.

Similar publications:

Log in to view a list of similar publications
Local

External

External

External

External

The publication has not yet bookmarked in any reading list

You cannot bookmark this publication into a reading list because you are not member of any
Log in to create one.

There are currently no annotations

To add an annotation you need to log in first

Download statistics

Log in to view the download statistics for this publication
Export bibliographic details as: CF Format · APA · BibTex · EndNote · Harvard · MLA · Nature · RIS · Science