A machine can play Lucas's game

A machine programmed to do transfinite counting could play Lucas's game as well as Lucas can. Lucas relies on the fact that transfinite counting hasn't been formalised. But the fact it hasn't doesn't mean humans are better at it than machines are.

Irving J. Good, (1967).

Transfinite numbers: Numbers that go beyond the magnitude of any finite set.

Transfinite counting: A form of arithmetic that works with transfinite numbers instead of just with finite numbers.

Notes: Also, see the "Can improved machines beat the Lucas argument?" arguments on this map, and "The Gödelization procedure can be algorithmically specified" Box 52.
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Argument from Gödel's theorem is dialectical
A machine can play Lucas's game
The super-mechanist
Good misunderstands the game
A dilemma about consistency
Lucas needs to produce entire Lucas arithmetic
No mechanists for Lucas to play with
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip