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
🔎
Finite time period only allows finite states
ArgumentOpposé
1
#3890
Only processes that require no time could occur infinitely often in a finite period. But causal processes occur in space/time and so require some time—however small. So, it's impossible for infinitely many causal processes to occur in a finite time.
Argument anticipated by Selmer Bringsjord, 1992.
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
▲
Yes: Automata can think »
Yes: Automata can think
Yes: Automata can think☜A finite automation, like a Turing machine, can replicate all essential aspects of human intelligence. Finite automata are completely mathematically possible. Thus, machine thinking is mathematically possible.☜59C6EF
▲
Humans have an infinite capacity machines lack »
Humans have an infinite capacity machines lack
Humans have an infinite capacity machines lack☜Unlike deterministic automata, persons might be in an infinite number of states within a finite period of time. Such an infinite capacity could allow persons to make decisions that machines could never make.☜EF597B
■
Finite time period only allows finite states
Finite time period only allows finite states☜Only processes that require no time could occur infinitely often in a finite period. But causal processes occur in space/time and so require some time—however small. So, its impossible for infinitely many causal processes to occur in a finite time.☜EF597B
●
The Zeus Machine »
The Zeus Machine
The Zeus Machine☜Its possible for infinitely many states to take place in a finite time period, as proven by the conceptual possibility of a Zeus Machine (see expanded text).☜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
+Commentaires (
0
)
- Commentaires
Ajouter un commentaire
Newest first
Oldest first
Show threads
+Citations (
0
)
- Citations
Ajouter une citation
List by:
Citerank
Map
+About
- About
Entrée par:
David Price
NodeID:
#3890
Node type:
OpposingArgument
Date d'entrée (GMT):
12/5/2007 11:30:00 PM
Date de la dernière modification (Heure GMT):
12/5/2007 11:30:00 PM
Show other editors
Corrélations entrantes:
0
Corrélations sortantes:
0
Evaluation moyenne:
0
by
0
utilisateurs
x
Select file to upload