AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
The Importance of Inputless Finite State Automata
In a paper called does a rock implement every inputless finite state automata David Chalmers responds to this argument in an interesting way and he says that yeah I'll concede if you like that we can implement really trivial machines. But when we want to look at machines with input this breaks down because we get a combinatorial explosion of states that we need. After a very short number of states we'll run out of the number of states needed is bigger than the number of atoms in the known universe and hence Putnam's mapping must fail. This intuition was brought real for me because again some people dispute the fact that there are serious scientists who believe in the machine consciousness program they definitely are.