Conscious enactive computation

12/03/2018
by   Daniel Estrada, et al.
0

This paper looks at recent debates in the enactivist literature on computation and consciousness in order to assess major obstacles to building artificial conscious agents. We consider a proposal from Villalobos and Dewhurst (2018) for enactive computation on the basis of organizational closure. We attempt to improve the argument by reflecting on the closed paths through state space taken by finite state automata. This motivates a defense against Clark's recent criticisms of "extended consciousness", and perhaps a new perspective on living with machines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2017

Timed Concurrent State Machines

Timed Concurrent State Machines are an application of Alur's Timed Autom...
research
06/27/2018

A Game-Semantic Model of Computation, Revisited: An Automata-Theoretic Perspective

In the previous work, we have given a novel, game-semantic model of comp...
research
06/03/2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices

We investigate the complexity of computing the Zariski closure of a fini...
research
02/12/2023

Computation with Large Advice

In this paper, we consider a new direction of computation, which we call...
research
08/17/2013

Decision Theory with Resource-Bounded Agents

There have been two major lines of research aimed at capturing resource-...
research
12/06/2022

State Space Closure: Revisiting Endless Online Level Generation via Reinforcement Learning

In this paper we revisit endless online level generation with the recent...

Please sign up or login with your details

Forgot password? Click here to reset