Views
Graph
Explorer
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 levels
Load all levels
All
Dagre
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 level
Load all levels
All
Tree
SpaceTree
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Radial
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Box
Focus
Expanding
Down
Up
All
Down
Page ✓
Article
Outline
Document
Down
All
Canvas
Time
Timeline
Calendar
Request email digest
Past 24 hours
Past 2 days
Past 3 days
Past week
Add
Add page
Add comment
Add citation
Edit
Edit page
Delete page
Share
Link
Bookmark
Embed
Social media
Login
Member login
Register now for a free account
🔎
Inductive machines immune to Gödelization
Palaikantis argumentas
1
#1094
Inductive thinking, which humans can do, would allow computers to understand their own Gödel sentences.
Argument anticipated by John Lucas (1961).
Immediately related elements
How this works
-
Artificial Intelligence »
Artificial Intelligence
Artificial Intelligence☜A collaboratively editable version of Robert Horns brilliant and pioneering debate map Can Computers Think?—exploring 50 years of philosophical argument about the possibility of computer thought.☜F1CEB7
▲
Are thinking computers mathematically possible? [7] »
Are thinking computers mathematically possible? [7]
Are thinking computers mathematically possible? [7]☜Is it mathematically possible for a computer to think as well as a human can? Does the mathematics of computation contain anything to prohibit machines from thinking?☜FFB597
▲
No: computers are limited by Gödel's theorems »
No: computers are limited by Gödel's theorems
No: computers are limited by Gödel's theorems☜Gödels theorem proves that a computer cant in principle operate with human understanding (see detailed text). Gödels incompleteness theorems are the Achilles heel of mechanism. John Lucas (1961).☜59C6EF
▲
Improved machines »
Improved machines
Improved machines☜A beefed-up machine can recognise the truth of the Gödel sentence. Such a machine defeats Lucass argument, because it shows that a formal system can evade Lucass Gödelizing ability.☜EF597B
■
Inductive machines immune to Gödelization
Inductive machines immune to Gödelization☜Inductive thinking, which humans can do, would allow computers to understand their own Gödel sentences.☜98CE71
●
Self programming inductive machines »
Self programming inductive machines
Self programming inductive machines☜Self-programming inductive machines have enough creativity to recognise the truth of Gödel sentences—and to beat the Lucas argument.☜98CE71
●
Some AI systems are inductive and probabilistic »
Some AI systems are inductive and probabilistic
Some AI systems are inductive and probabilistic☜The Gödel argument correctly shows that there are limits on deductive machines. But, artificial intelligence deals with inductive and probabilistic mechanisms that Gödel theorem does not apply to.☜98CE71
●
A dilemma about inductive machines »
A dilemma about inductive machines
A dilemma about inductive machines☜Seeking to avoid the Gödelization problem by making inductive machines results in a dilemma (see detailed text). An inductive machine isnt an adequate model of the mind.☜EF597B
Heading
Summary
Click the button to enter task scheduling information
Open
Details
Enter task details
Message text
Select assignee(s)
Due date (click calendar)
RadDatePicker
RadDatePicker
Open the calendar popup.
Calendar
Title and navigation
Title and navigation
<<
<
November 2024
>
<<
November 2024
S
M
T
W
T
F
S
44
27
28
29
30
31
1
2
45
3
4
5
6
7
8
9
46
10
11
12
13
14
15
16
47
17
18
19
20
21
22
23
48
24
25
26
27
28
29
30
49
1
2
3
4
5
6
7
Reminder
No reminder
1 day before due
2 days before due
3 days before due
1 week before due
Ready to post
Copy to text
Enter
Cancel
Task assignment(s) have been emailed and cannot now be altered
Lock
Cancel
Save
Comment graphing options
Choose comments:
Comment only
Whole thread
All comments
Choose location:
To a new map
To this map
New map options
Select map ontology
Options
Standard (default) ontology
College debate ontology
Hypothesis ontology
Influence diagram ontology
Story ontology
Graph to private map
Cancel
Proceed
+Komentarai (
0
)
- Komentarai
Komentuoti
Newest first
Oldest first
Show threads
+Citavimą (
0
)
- Citavimą
Pridėti citatą
List by:
Citerank
Map
+About
- About
Redagavo:
David Price
NodeID:
#1094
Node type:
SupportiveArgument
Įvedimo data (GMT):
8/29/2006 8:01:00 PM
Paskutinės redakcijos data (GMT laikas):
10/23/2007 1:03:00 PM
Show other editors
Įeinančios sąsajos:
0
Išeinančios sąsajos:
0
Vidutinis vertinimas:
0
by
0
vartotojai
x
Select file to upload