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
đ
Roger Penrose
Protagonist
1
#2775
Arguments advanced by Roger Penrose.
CONTEXT
(Help)
-
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
▲
Protagonists »
Protagonists
ProtagonistsâThe contributions of over 300 protagonists can be explored via a surname search, or using the growing list developing here.âD3B8AB
■
Roger Penrose
Roger PenroseâArguments advanced by Roger Penrose.âD3B8AB
►
No: computers can't have emotions »
No: computers can't have emotions
No: computers can't have emotionsâMachines can never be in emotional states (they can never be angry, joyous, fearful etc), and emotions are necessary for thought.âFFFACD
►
Low-level quantum effects are uncomputable »
Low-level quantum effects are uncomputable
Low-level quantum effects are uncomputableâThe biological phenomena that underlie consciousness operate at a level which quantum effects could exert an influence. Because quantum effects are not computable, the brain and consciousness may be noncomputational and nonalgorithmic. âFFFACD
►
Mathematical insight is non-algorithmic »
Mathematical insight is non-algorithmic
Mathematical insight is non-algorithmicâMany problems of mathematicsâeg Gödels incompleteness problem, the halting problem, etcâcan be understood by conscious humans but cant be solved algorithmically. This shows mathematical insight is based on conscious non-algorithmic processes.âFFFACD
►
The absurdity of algorithmic insight »
The absurdity of algorithmic insight
The absurdity of algorithmic insightâThe claim that mathematical insight is algorithmic can be reduced to absurdity (see detailed text).âFFFACD
►
Insight is essential even if it is fallible »
Insight is essential even if it is fallible
Insight is essential even if it is fallibleâJust because insight is sometimes unreliable, we should not conclude that it plays no essential role in mathematics.âFFFACD
►
Glymour and Kelly are too strict »
Glymour and Kelly are too strict
Glymour and Kelly are too strictâIf Glymour and Kelly are right, then it is impossible to verify or refute any scientific theory. But in practice scientific theories can be tested. So it may be possible to test for algorithmicity even if absolute certainty cant be obtained.âFFFACD
►
Gödelian insight is a slippery character »
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.âFFFACD
►
The Gödelian insight is all that we need »
The Gödelian insight is all that we need
The Gödelian insight is all that we needâIts not necessary to see the consistency of an entire formal system. The ability to pass from one formal system to the Gödel sentence of that formal system is enough.âFFFACD
►
Connectionist networks are formal systems »
Connectionist networks are formal systems
Connectionist networks are formal systemsâArguments used against the formal character of symbol manipulators apply equally well to connectionist networks [CNs]. Functions computed on a CN can also be computed on a serial machine and CNs can implement classical serial processing.âFFFACD
◄
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
<<
<
May 2024
>
<<
May 2024
S
M
T
W
T
F
S
18
28
29
30
1
2
3
4
19
5
6
7
8
9
10
11
20
12
13
14
15
16
17
18
21
19
20
21
22
23
24
25
22
26
27
28
29
30
31
1
23
2
3
4
5
6
7
8
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
+Comments (
0
)
- Comments
Add a comment
Newest first
Oldest first
Show threads
+Citations (
0
)
- Citations
Add new citation
List by:
Citerank
Map
+About
- About
Entered by:-
David Price
NodeID:
#2775
Node type:
Protagonist
Entry date (GMT):
7/20/2007 6:09:00 PM
Last edit date (GMT):
7/20/2007 6:09:00 PM
Show other editors
Incoming cross-relations:
1
Outgoing cross-relations:
9
Average rating:
0
by
0
users
x
Select file to upload