Lexicon of Arguments

Philosophical and Scientific Issues in Dispute
 
[german]


Complaints - Corrections

Table
Concepts
Versus
Sc. Camps
Theses I
Theses II

Concept/Author*  

What is wrong?
Page
Other metadata
Translation
Excerpt or content
Other

Correction: Year / Place / Page
/ /

Correction:
(max 500 charact.)

Your username*
or User-ID

Email address*

The complaint
will not be published.

 
III 15
Turing Machine/Putnam: a Turing machine can only calculate recursive functions.
New: there is proof of the possibility of a physical analog computer that can calculate non-recursive functions. There is no reason why the real numbers, representing the states of nature should be "recursive".
>Recursion.
​​III 18
Behavioral interpretation: the Turing machine does not explain performance but competence.
>Performance, >Competence.
---
IV 153
Turing machine/Putnam: there is no "sequence of states," that 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: it is wrong to assume that in order to know something we would have to know certain assumptions.
Logically the Turing machine has only finitely many states.
Technical: technically there are 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.
The functional organization can be described without taking into account the technical realization.
>Description levels, >Function/Putnam, >Functional explanation, >Syntax.

Found an error? Use our Complaint Form. Perhaps someone forgot to close a bracket? A page number is wrong?
Help us to improve our lexicon.
However, if you are of a different opinion, as regards the validity of the argument, post your own argument beside the contested one.
The correction will be sent to the contributor of the original entry to get his opinion about.