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
🔎
Gödelian insight is a slippery character
Einwand
1
#1113
The Gödelian insight can attach itself to any system that has been algorithmically specified, including an algorithmic specification of the Gödelization procedure.
Roger Penrose (1990).
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
▲
The Gödelian insight has already been formalised »
The Gödelian insight has already been formalised
The Gödelian insight has already been formalised☜Programs have been developed that can derive Gödels theorems. The Gödelian insight has, in effect, been formalised.☜98CE71
▲
Gödelization procedure algorithmically specifiable »
Gödelization procedure algorithmically specifiable
Gödelization procedure algorithmically specifiable☜The mathematical Gödelization process can be formalised. It is meta in the sense that a formal mathematical processes is being used to reason about a mathematical process.☜98CE71
■
Gödelian insight is a slippery character
Gödelian insight is a slippery character☜The Gödelian insight can attach itself to any system that has been algorithmically specified, including an algorithmic specification of the Gödelization procedure.☜EF597B
◄
Roger Penrose »
Roger Penrose
Roger Penrose☜Arguments advanced by Roger Penrose.☜FFFACD
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
+Kommentare (
0
)
- Kommentare
Kommentar hinzufügen
Newest first
Oldest first
Show threads
+Verweise (
0
)
- Verweise
Hinzufügen
List by:
Citerank
Map
+About
- About
Eingabe von:
David Price
NodeID:
#1113
Node type:
OpposingArgument
Eingabedatum (GMT):
8/30/2006 10:50:00 AM
Zuletzt geändert am (GMT):
10/23/2007 1:59:00 PM
Show other editors
Eingehende Kreuzverbindungen
1
Abgehende Kreuzverbindungen
0
Durchschnittsbewertung
0
by
0
Nutzer
x
Select file to upload