Books on Amazon
Turing machine/Putnam: can only calculate recursive functions - new: proof of the possibility of physical analog computer that can calculate non-recursive functions - no reason why the real numbers, representing the states of nature should be "recursive".
Behavioral interpretation: Turing-Machine does not explain performance but competence.
Turing machine/Putnam: there is no "sequence of states," the Turing-Machine must go through in order to be in a certain single state - or it goes through them, but it does not have to determine them - analog error of tradition: that in order to know something we would have to know certain assumptions - logically the Turing-Machine has only finitely many states - technical: infinitely many (some may be partially broken, and yet provide values) - N.B.: the error is not in the sentence "I am in state A", because the state is identical to the command to print it - analogy: pain but no fever - functional organization can be described without taking into account the technical realization.
Von einem Realistischen Standpunkt Frankfurt 1993
Repräsentation und Realität Frankfurt 1999
Für eine Erneuerung der Philosophie Stuttgart 1997
Pragmatismus Eine offene Frage Frankfurt 1995
Vernunft, Wahrheit und Geschichte Frankfurt 1990