Details view: Machine could be updated

Views
Add
Edit
- Edit page
- Delete page
Share
Login
- Member login
- Register now for a free account
🔎

Machine could be updated Einwand1 #284 Programmers could periodically update the machine's list of responses.
Ned Block, 1981.

Immediately related elementsHow this works

Artificial Intelligence »Artificial IntelligenceArtificial 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

▲

Can the Turing Test determine this? [2] »Can the Turing Test determine this? [2] Can the Turing Test determine this? [2] ☜Is the Turing Test—proposed by Alan Turing in 1950—an adequate test of thinking? Can it determine whether a machine can think? If a computer passess the test by persuading judges via a teletyped conversation that its human can it be said to think?☜FFB597

▲

No: but Neo-Turing test is adequate »No: but Neo-Turing test is adequateNo: but Neo-Turing test is adequate☜The neo-Turing test interprets the Turing test as providing an overt, measurable behavioural and operational definition of thinking—and refines the test to avoid classical problems associated with behaviourism and other related criticisms.☜59C6EF

▲

The Psychologism Objection »The Psychologism ObjectionThe Psychologism Objection☜Behaviour by itself isnt enough: internal differences matter. If two systems behave in exactly the same way, one might be intelligent while the other is stupid because of differences in the way each system processes information.☜EF597B

▲

All Possible Conversations Machine »All Possible Conversations MachineAll Possible Conversations Machine☜An unintelligent machine engaging in sensible conversation by searching a database containing all possible lines of conversation in a finite Turing test, would pass the neo-Turing test—but it would be only echoing its programmers intelligence.☜98CE71

▲

Machine is dated »Machine is datedMachine is dated☜The machine would not be able to answer questions about current events.☜EF597B

■

Machine could be updatedMachine could be updated☜Programmers could periodically update the machines list of responses.☜EF597B

◄

Ned Block »Ned BlockNed Block☜Arguments advanced by Ned Block.☜FFFACD

Heading

Summary

Click the button to enter task scheduling information

Details

Enter task details

Message text

Select assignee(s)

Due date (click calendar)

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

Ready to post Copy to text

Task assignment(s) have been emailed and cannot now be altered

Lock

Comment graphing options

Choose comments:Comment onlyWhole threadAll comments

Choose location:To a new mapTo this map

New map options

Select map ontology Graph to private map

+Kommentare (0)

- KommentareKommentar hinzufügenNewest firstOldest firstShow threads

+Verweise (0)

- VerweiseHinzufügenList by: CiterankMap

+About

- About

Eingabe von: David Price
NodeID: #284
Node type: OpposingArgument
Eingabedatum (GMT): 6/15/2006 1:38:00 PM
Zuletzt geändert am (GMT): 12/9/2007 11:20:00 PM
Show other editors
Eingehende Kreuzverbindungen 1
Abgehende Kreuzverbindungen 0
Durchschnittsbewertung 0 by 0 Nutzer

x Select file to upload