Re:The Lucas-Penrose Argument about Gödel's Theorem (2012)
by simonh on Tuesday May 30, 2017 @12:35PM
(#14446513)
> Something we learn in mathematics is that two theories concerning different objects can be formally equivalent.
Can be, but do not have to be. A distinction through which a host of mistakes have fallen, including Donald Hoffman's 'disproof' of functionalism.
Re:The Lucas-Penrose Argument about Gödel's Theorem (2012)
by jamesrcole on Tuesday May 30, 2017 @11:06AM
(#14445863)
For a bit of context on Feser and his views, see https://en.wikipedia.org/wiki/Edward_Feser
Computers are strictly devoid of semantics. They are, at best, purely syntactic machines. There is no amount of syntax than can ever lead to semantics. Strictly speaking, computers don't even compute.
Further reading: http://edwardfeser.blogspot.com/2013/10/do-machines-compute-...