Gödelian Argument Against Computationalism
Definition
An argument using Gödel's incompleteness theorem: for any sound formal proof system you trust, you can construct a true statement the system cannot prove yet that you can see is true via the same understanding; therefore human understanding cannot be the execution of any fixed algorithm.
Cast within
No topic-region cast yet — this appears once Gödelian Argument Against Computationalism's compiled claims are aligned into a topic region's argument tree.
Claims mentioning Gödelian Argument Against Computationalism (2)
Your notes
Loading notes...