Switch to: References

Add citations

You must login to add citations.
  1. Other bodies, other minds: A machine incarnation of an old philosophical problem. [REVIEW]Stevan Harnad - 1991 - Minds and Machines 1 (1):43-54.
    Explaining the mind by building machines with minds runs into the other-minds problem: How can we tell whether any body other than our own has a mind when the only way to know is by being the other body? In practice we all use some form of Turing Test: If it can do everything a body with a mind can do such that we can't tell them apart, we have no basis for doubting it has a mind. But what is (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   87 citations  
  • Minds, machines and Turing: The indistinguishability of indistinguishables.Stevan Harnad - 2000 - Journal of Logic, Language and Information 9 (4):425-445.
    Turing's celebrated 1950 paper proposes a very general methodological criterion for modelling mental function: total functional equivalence and indistinguishability. His criterion gives rise to a hierarchy of Turing Tests, from subtotal ("toy") fragments of our functions (t1), to total symbolic (pen-pal) function (T2 -- the standard Turing Test), to total external sensorimotor (robotic) function (T3), to total internal microfunction (T4), to total indistinguishability in every empirically discernible respect (T5). This is a "reverse-engineering" hierarchy of (decreasing) empirical underdetermination of the theory (...)
    Direct download (17 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Computation is just interpretable symbol manipulation; cognition isn't.Stevan Harnad - 1994 - Minds and Machines 4 (4):379-90.
    Computation is interpretable symbol manipulation. Symbols are objects that are manipulated on the basis of rules operating only on theirshapes, which are arbitrary in relation to what they can be interpreted as meaning. Even if one accepts the Church/Turing Thesis that computation is unique, universal and very near omnipotent, not everything is a computer, because not everything can be given a systematic interpretation; and certainly everything can''t be givenevery systematic interpretation. But even after computers and computation have been successfully distinguished (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Computer verification for historians of philosophy.Landon D. C. Elkind - 2022 - Synthese 200 (3):1-28.
    Interactive theorem provers might seem particularly impractical in the history of philosophy. Journal articles in this discipline are generally not formalized. Interactive theorem provers involve a learning curve for which the payoffs might seem minimal. In this article I argue that interactive theorem provers have already demonstrated their potential as a useful tool for historians of philosophy; I do this by highlighting examples of work where this has already been done. Further, I argue that interactive theorem provers can continue to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark