1950
Selekoa’s 7 records dated 1950, in date order, grouped by topic.
Selective: what the records hold, not a history of the year.
How this page is made
- Each record keeps the kind of date its source gives: an event, a publication, an announcement, an effective date, a revision, a signature, a snapshot, or the start or end of an interval. A snapshot is one dated report of a state.
- A record dated only to a month sits under that month, before the records dated to a day. A record dated only to the year sits under the year, before the months. No day or month is added.
- An announcement records what a party stated. It does not show that anything was done, built or paid for.
- Dates a party states for a year are listed apart, after the records: targets, deadlines and terms, and dates stated in passing, such as a reported start of operation. So is a record’s own date that falls after its sources were last checked, such as a law’s date of effect. A stated date given only in words, with no year, is not listed.
- Records with an unknown date are not listed. A record with an interval appears in the year it starts and in the year it ends, or once, with both dates, when both fall in one year.
- Each provision of a text is a record of its own. Provisions sharing a text and a date are shown here as one entry, with their number, and listed on the text’s page; a contested or unresolved one is listed here on its own. The counts on this page include each provision record.
- The page is generated from the records, with no selection or framing by an editor. Coverage is uneven across years and topics: a year or topic with few records may be one the records barely cover.
Ideas & lineages 7 records
October 1950
· publication · dated to the month
“Computing Machinery and Intelligence” (1950-10) credits A. M. Turing as its author. Evidence ↗· publication · dated to the month
Turing’s 1950 paper proposes programming a child-like machine and educating it, and says a machine could help make up its own programmes and modify them to achieve a purpose more effectively. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →
· publication · dated to the month
Turing’s 1950 paper says a machine could modify its own programmes after observing its behaviour, and proposes educating a child machine. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →
· publication · dated to the month
Turing’s 1950 paper says a machine could help make up its own programmes. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →
· publication · dated to the month
Turing’s 1950 paper has a machine deliberately make arithmetic mistakes so as not to be unmasked in the imitation game. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →
· publication · dated to the month
Turing’s 1950 paper describes a machine that would hide its arithmetic accuracy from the interrogator in the imitation game. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →
· publication · dated to the month
Turing’s 1950 paper says that a machine programmed for the imitation game would not give the right answers to arithmetic problems but would deliberately introduce mistakes calculated to confuse the interrogator. Evidence ↗Turing, Computing Machinery and Intelligence (1950) →Claim page →