The concept of computability (Q1434377): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134221647 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3699678 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792801 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792712 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypercomputation: Philosophical issues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3916562 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4207876 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Limiting recursion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Trial and error predicates and the solution to a problem of Mostowski / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792709 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hilbert's Programs: 1917–1922 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792711 / rank | |||
Normal rank | |||
Latest revision as of 18:32, 6 June 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
