The concept of computability (Q1434377): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:19, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The concept of computability |
scientific article |
Statements
The concept of computability (English)
0 references
4 August 2004
0 references
A polemic in which the philosopher author presumes to tell computer scientists what topics they ``would be better off focusing'' on. According to Cleland, computer scientists are woefully off-base about their own subject because ``Turing machines do not provide us with genuine procedures''. The paper contains various other startling claims, such as that without real/complex analysis, abstract algebra would disappear.
0 references
Entscheidungsproblem
0 references
Hilbert
0 references
Turing machine
0 references
computability
0 references