1
1.3 Extending skills
Discuss the example and elicit whether they think a timeline is appropriate for a lecture on major landmarks in the development of AI and whether they would consider anything else. Elicit how the lecture is likely to be organized – the word landmarks should provide a clue that it will discuss a sequence of events – so possibly a flow chart may be appropriate also.
Set for individual work and pairwork checking. 05–09
Play each lecture introduction in turn.
Pause after each one and allow students to discuss before giving them the suggested answer.
Explain that sometimes lecturers move from one information organization to another within the same lecture, e.g., cause and effect, then sequence of events.
Students may suggest different answers in some cases. Discuss.
Suggested answers 1. two-column table (advantages and disadvantages) 2. timeline (sequence of events) 3. headings and notes/flow chart (stages of a process)
4. headings and notes/two-column table (problem and solution)
5. spidergram/tree diagram (classification and definition)
05 Introduction 1
Today, I’m going to talk about the advantages and disadvantages of machine translation: using computers to translate from one language to another. For a long time, translation could only be done by humans who had a good knowledge of the languages they wanted to translate. Often, they needed to use tools such as dictionaries to identify words or phrases that they didn’t know. The development of machine translation has made it possible for written and spoken texts to be translated by computers.
06 Introduction 2
The purpose of today’s lecture is to look at some major landmarks in the development of artificial intelligence – AI. One way of testing artificial intelligence is to see whether a machine can play a game as well as a human. A famous early instance of this test was in 1770, when a machine called the Mechanical Turk was constructed which appeared to play chess as well as the best human players. Unfortunately, the machine was later shown to be a fake: the game was not really played by the machine,
24
but by a person hidden inside. The modern era of artificial intelligence could be said to have begun with the 1950 paper by Alan Turing called ‘Computing Machinery and Intelligence’, in which Turing discussed how to build intelligent machines and how to test their intelligence. In his ‘imitation game’, which later became known as the ‘Turing test’, Turing suggested a method of testing whether a machine was intelligent or not. In this test, a person would have a conversation with a computer and another human being at the same time. If they could not tell the difference between the two, then the computer would have passed the test.
07 Introduction 3
A number of different phases make up what is known as the Software Development Life Cycle, or the SDLC. The SDLC is a process designed to produce high-quality, low- cost software as quickly as possible. Different methods can be used with this process. These include the waterfall method, iterative methods and spiral methods. The most common phases of the SDLC are: requirement analysis; planning; software design; software development and testing and deployment.
08 Introduction 4
A key challenge for software engineers is ensuring that computer programs can do what they have been designed to do. Very often, when software is written, it has bugs, which means that the program won’t run properly. Sometimes these bugs are difficult to find. For example, during the 1980s, there was a bug in the code that controlled X-ray machines treating people with cancer. The bug was not discovered for a long time, and a number of patients died as a result. Bugs can also be very costly in other ways. In 1996, a European rocket system costing hundreds of millions of dollars was destroyed because of a bug in the software for the control systems. So, you can see that it is important to avoid bugs in software. This lecture will discuss some of the different approaches which have been used to improve the quality of software, so that there are many fewer bugs in the final product: how to make developers test early, how to improve the efficiency and effectiveness of late testing and how to automate testing.
09 Introduction 5
Defining exactly what we mean by a computer system is not easy, but we can point to five steps that any computer system should be able to perform. It should be able to take some type of data as input. It should be able to store the data and instructions on how to process the data in some form of memory. It should then be able to process the data using the instructions, and to generate some output from this. Finally, it should be able to control all of these steps.
Page 1 |
Page 2 |
Page 3 |
Page 4 |
Page 5 |
Page 6 |
Page 7 |
Page 8 |
Page 9 |
Page 10 |
Page 11 |
Page 12 |
Page 13 |
Page 14 |
Page 15 |
Page 16 |
Page 17 |
Page 18 |
Page 19 |
Page 20 |
Page 21 |
Page 22 |
Page 23 |
Page 24 |
Page 25 |
Page 26 |
Page 27 |
Page 28 |
Page 29 |
Page 30 |
Page 31 |
Page 32 |
Page 33 |
Page 34 |
Page 35 |
Page 36 |
Page 37 |
Page 38 |
Page 39 |
Page 40 |
Page 41 |
Page 42 |
Page 43 |
Page 44 |
Page 45 |
Page 46 |
Page 47 |
Page 48 |
Page 49 |
Page 50 |
Page 51 |
Page 52 |
Page 53 |
Page 54 |
Page 55 |
Page 56 |
Page 57 |
Page 58 |
Page 59 |
Page 60 |
Page 61 |
Page 62 |
Page 63 |
Page 64 |
Page 65 |
Page 66 |
Page 67 |
Page 68 |
Page 69 |
Page 70 |
Page 71 |
Page 72 |
Page 73 |
Page 74 |
Page 75 |
Page 76 |
Page 77 |
Page 78 |
Page 79 |
Page 80 |
Page 81 |
Page 82 |
Page 83 |
Page 84 |
Page 85 |
Page 86 |
Page 87 |
Page 88 |
Page 89 |
Page 90 |
Page 91 |
Page 92 |
Page 93 |
Page 94 |
Page 95 |
Page 96 |
Page 97 |
Page 98 |
Page 99 |
Page 100 |
Page 101 |
Page 102 |
Page 103 |
Page 104 |
Page 105 |
Page 106 |
Page 107 |
Page 108 |
Page 109 |
Page 110 |
Page 111 |
Page 112 |
Page 113 |
Page 114 |
Page 115 |
Page 116 |
Page 117 |
Page 118 |
Page 119 |
Page 120 |
Page 121 |
Page 122 |
Page 123 |
Page 124 |
Page 125 |
Page 126 |
Page 127 |
Page 128 |
Page 129 |
Page 130 |
Page 131 |
Page 132 |
Page 133 |
Page 134 |
Page 135 |
Page 136 |
Page 137 |
Page 138 |
Page 139 |
Page 140 |
Page 141 |
Page 142 |
Page 143 |
Page 144 |
Page 145 |
Page 146 |
Page 147 |
Page 148 |
Page 149 |
Page 150 |
Page 151 |
Page 152 |
Page 153 |
Page 154 |
Page 155 |
Page 156 |
Page 157 |
Page 158 |
Page 159 |
Page 160 |
Page 161 |
Page 162 |
Page 163 |
Page 164 |
Page 165 |
Page 166 |
Page 167 |
Page 168 |
Page 169 |
Page 170 |
Page 171 |
Page 172 |
Page 173 |
Page 174 |
Page 175 |
Page 176 |
Page 177 |
Page 178 |
Page 179 |
Page 180 |
Page 181 |
Page 182 |
Page 183 |
Page 184 |
Page 185 |
Page 186 |
Page 187 |
Page 188 |
Page 189 |
Page 190 |
Page 191 |
Page 192 |
Page 193 |
Page 194 |
Page 195 |
Page 196 |
Page 197 |
Page 198 |
Page 199 |
Page 200 |
Page 201 |
Page 202 |
Page 203 |
Page 204 |
Page 205 |
Page 206 |
Page 207 |
Page 208 |
Page 209 |
Page 210 |
Page 211 |
Page 212 |
Page 213 |
Page 214 |
Page 215 |
Page 216 |
Page 217 |
Page 218 |
Page 219 |
Page 220 |
Page 221 |
Page 222 |
Page 223 |
Page 224 |
Page 225 |
Page 226 |
Page 227 |
Page 228 |
Page 229 |
Page 230 |
Page 231 |
Page 232 |
Page 233 |
Page 234 |
Page 235 |
Page 236 |
Page 237 |
Page 238 |
Page 239 |
Page 240 |
Page 241 |
Page 242 |
Page 243 |
Page 244 |
Page 245 |
Page 246 |
Page 247 |
Page 248 |
Page 249 |
Page 250 |
Page 251 |
Page 252 |
Page 253 |
Page 254 |
Page 255 |
Page 256 |
Page 257 |
Page 258 |
Page 259
