Гвоздева Цомпутер сциенце 2011

13.a variety of – a group of different kinds

14.an application – a usage

POST-READING TASK

(To be done at home in writing)

I. Innumerate the points of computer development. Begin with:

1. Computers will become more advanced.

II. Say what you mean by ‘a more advanced computer’?

III. Innumerate the newly arisen ethical problems in the Internet and World Wide Web. Formulate your attitude to them.

CLASS EXERCISES

Exercise 1 (in groups)

Checking up understanding

1.What field did Gordon Moore specialize in?

2.How did Moore formulate his law?

3.How accurate has his law proved to be?

4.Along what lines will computers develop?

5.How can computer scientists make the operation of a computer easier?

6.What is virtual reality?

7.What computer languages are being developed for the World Wide Web? Why?

8.What is the advantage of broadband communication systems?

9.What is a client system?

10.What are the new applications of servers?

Exercise 2 (do it yourself)

21

Formulate questions.

1.Moore predicted …. (What?)

2.Moore’s law has proved to be accurate. (General question)

3.New ethical problems have arisen. (What ethical problems?)

4.……… will make the operation of computers easier. (What technologies?)

5.Virtual reality is ………………. (What?)

6.…………….. are being developed for the World Wide Web. (What languages?)

7.The advantage of broadband communication systems is ………..

(What?)

8.PCs and workstations will be replaced by …… (What ……….

by?)

9.The new servers will include …….. (What?)

Exercise 3 (in groups)

Ask the above formulated questions and give answers to them.

UNIT 5

QUANTUM COMPUTING

“The classical purely mathematical theory of computation is not complete because it does not describe all physically possible computations”

David Deutch

PRE-READING TASK Study some grammar points.

I. N + to V (active); N + to be V3 (passive)

An infinitive (to V) after a noun characterizes it and expresses an action that must be done or could be done in the future.

Study the sentences.

1. Quantum computers use components of a chloroform molecule and a medical procedure called magnetic resonance imaging to compute at a molecular level.

22

2. One of the new technologies uses the cable-TV network to transmit data by cable modems.

II. Modal verbs show the attitude of the speaker to the idea he expresses.

S + may (might) + V = perhaps Might is more unsure than may Study the sentences.

1.Quantum computers may one day be thousands to millions of times faster than current computers.

2.Home servers may also play a role in home automation systems in the future.

III. Gerund = preposition + N + Ving = Russian – то, что

Study the sentence.

1.Instead of many processors working in parallel we have only one quantum processor.

Give Russian correspondence:

a procedure (a method, a technique), current (present day), to take advantage of (to use), at one time (at once), instead of (rather)

Terminology

1.magnetic resonance imaging (MRI) − томография

2.a state vector – вектор состояния

A BREAKTHROUGH IN COMPUTING

Study the passage.

Breakthroughs occurred in the area of quantum computing in the late 199Os. Quantum computers under development use components of a chloroform molecule (a combination of chlorine and hydrogen atoms) and a medical procedure called magnetic resonance imaging (MRI) to compute at a molecular level. Scientists used a branch of physics called quantum mechanics, which describes the activity of subatomic particles (particles that make up atoms), as the basis for quantum computing. Quantum computers may one day be thousands to millions of times faster than current computers, because they take advantage of the laws that govern the behavior of subatomic particles. These laws

23

allow quantum computers to examine all possible answers to a query at one time.

Quantum computers can compute faster because they can accept as the input not a one number but a coherent superposition of many different numbers and perform a computation (a sequence of unitary operations) on all of these numbers simultaneously. This can be viewed as a massive parallel computation, but instead of many processors working in parallel we have only one quantum processor performing a computation that affects all components of the state vector.

Vocabulary Notes

1.to occur – to take place

2.the computers that are under development are the computers that are being developed

3.a query – a question

4.to accept – (here) to use

5.to perform – to make

6.a sequence – a chain – a series

7.simultaneously – at the same time

8.to view – to consider

POST-READING TASK (to be done in writing)

I. Write a summary by answering the questions.

1.At what level will quantum computers make calculations?

2.What is the basis of quantum computing?

3.What do the laws of quantum mechanics allow quantum computers to do?

4.Why will quantum computers compute faster?

5 How many times will quantum computers compute faster than current computers?

6. What is the difference between parallel computing and quantum

24

1.Breakthroughs occurred in the area of quantum computing ……. (When?)

2.Computer scientists used a branch of physics as the basis for quantum computing. (What branch of physics?)

3.Quantum mechanics describes ………….. (What?)

4.Quantum computers may be ………… faster than current computers. (How many times faster?)

5.Quantum computers can compute faster than current computers. (Why?)

CLASS EXERCISES

Exercise 1 (in pairs)

Answer the questions formulated in post-reading III.

Exercise 2 (do it yourself)

Translate the sentences.

1.Сейчас разрабатываются квантовые компьютеры.

2.Прорыв в области квантовой обработки данных произошёл в конце 90-х годов.

3.Учёные используют квантовую механику в качестве основы для квантовой обработки данных.

4.Для обработки данных используются законы взаимодействия ядерных частиц.

5.Эти законы позволят квантовым компьютерам проверять все возможные ответы на вопрос одновременно.

6.Поэтому, квантовые компьютеры будут в миллионы раз быстрее, чем современные компьютеры.

25

UNIT 6

THE QUANTUM THEORY OF COMPUTATION

Interview with Dr. David Deutch

PRE-READING TASK Study some grammar points.

I. We use one(s) to replace the noun(s) mentioned before. Study the sentences.

1.Any computer will be able to completely duplicate all the functions of any other one.

2.A single-sided DVD will hold 4.7 GB or 7.5 GB, a double-sided one, up to 17 GB.

II. We use to V after the first, the second etc, the last and the next.

Study the sentence.

Alan Turing was the first person to postulate a universal computing

machine.

III. Ving is a verbal noun. It is formed from a verb + ing. While an infinitive expresses an action, a verbal noun expresses a process. We use Ving as the subject of the sentence or in combination with prepositions.

Study the sentences.

1.Going to the moon is nothing compared with quantum computa-

tion.

2.Instead of having many processors working in parallel we have only one quantum processor.

3.Trying to write software that accounts for every possibility leads to what computer scientists call “combinatorial explosion.”

Give Russian correspondence.

in terms of (as regards), any, within (inside), an impact (an effect), no matter (regardless), extra (additional), in general (ant. in particular), a challenge (a problem to be solved), compared with, before, well before

26

Terminology

1.information processing

2.a memory capacity − объем запоми-

нающего устройства

In this interview, a Special Topics correspondent talks with Dr. David Deutsch, of the

Centre for Quantum Computation at the University of Oxford, about his career in quantum theory and computer research.

Study the interview.

ST: What is a universal computer?

DD: All existing computers, the one you have on your desk, the supercomputers that the National Security Agency uses, and the computer in your watch and so on, all of them are, in terms of their repertoire of possible computations, completely identical to each other. They differ only in speed and memory capacity. Any one of them, if you let it run long enough or give it enough memory, will be able to completely duplicate all the functions of any other one. That property is called universality. Alan Turing was the first person to postulate a universal computing machine and prove it was universal within a certain domain. But that was for classical physics, not quantum physics. My innovation was to redo his work using quantum physics instead of classical physics.

ST: When did you do that work; where was it published and what was the impact?

DD: That was in the early 1980s and published in 1985 in the Proceedings of the Royal Society of London. That paper began the modern subject of the quantum theory of computation, which provides many types of computation that a quantum computer can do but a classical computer cannot do, no matter how much extra memory and extra time it is given.

ST: What about the future of quantum computation in general?

DD: Practical applications of quantum computation in general are far more distant. Quantum computation is one of the greatest challenges facing experimental physics. Going to the moon is nothing compared with it. We are talking about decades before anything useful comes out. Well before quantum computers are practical or before we know how to do quantum computation in the laboratory, the quantum theory of com-

27

putation is teaching us a lot about physics, because any experiment is information processing.

POST-READING TASK (To be done in writing)

I. Write a summary by answering the questions.

1.In terms of what characteristics are computers identical to each other?

2.What do computers differ in?

3.What property is called universality?

4.What do you know about Alan Turing?

5.How soon would quantum computers become practicable?

II. Make up sentences using the expressions.

1.to be identical to each other

2.to differ in

3.no matter how

4.the greatest challenge

5.information processing

III. Formulate some questions you would like to ask Dr. David Deutsch.

IV. Write a short essay on Data Processing Development using passages 4, 5 and 6 as the basis.

CLASS ACTIVITY

You are participating in the conference: Data Processing Development. Give a talk. The audience is asking questions.

UNIT 7

THEORY OF COMPUTATION

From Wikipedia, the free encyclopedia

PRE-READING TASK Study some grammar points.

I. We use whether when talking about two alternatives. (Russian V + ли)

28

Study the sentences.

1.The theory of computation is the branch of computer science that deals with whether and how efficiently problems can be solved on a computer.

2.The coming months will reveal whether the very long instruction word (VLIW) is a candidate for inclusion in the next wave of highperformance microprocessor architecture.

II. Active and Passive

A verb has two categories: tense (past, present and future) and voice (active and passive). There are two infinitives: active to V and passive to be + V3.

On the basis of an active infinitive we form active sentences and use active when it is important who or what does the action.

On the basis of a passive infinitive we form passive sentences and prefer passive when it is not important who or what does the action.

In passive sentences we use be (is, are, was, were, has been, will be etc) + V3.

Study the sentences.

1.The theory of computation is divided into two main branches.

2.The specifications for DVD have been accepted by the consumer electronics, computer and movie industries.

Note: We use the passive infinitive after model verbs. Compare:

1.A computer can solve this problem. This problem can be solved on a computer.

2.You can manage the network computers remotely and centrally. The network computers can be managed remotely and centrally. III. We use must and have to (do) to say that it is necessary to do

something. Often it doesn’t matter which you use.

Study the sentences.

1.If we say there are n numbers in the list, then if the list is not sorted or indexed in any way, we may have to look at every number in order to find the number.

IV. You translate a past participle V3 without any words referring to it before you translate a N.

29

Study the sentences.

1.For any problem solved by a Turing machine the memory used will always be finite,

2.Any problem that can be solved on a Turing machine could be solved on a desktop PC which has enough memory installed.

3.Over 55% of printers sold are ink-jet models.

V. Modal verbs show the attitude of the speaker to the idea he expresses.

S + may (might) + V = perhaps Might is more unsure than may Study the sentences.

1. We may have to look at every number in order to find the number we're seeking.

VI. When we imagine a situation we use would (could, might) +

+ Vo

would – (Russian) бы

could, might – (Russian) мог бы

Study the sentences.

1.The infinite memory capacity might be considered an unphysical attribute.

2.So in our previous example we might say that the problem requires O(n) steps to be solved.

3.Any problem that can be solved on a Turing machine could be solved on a desktop PC.

Give Russian correspondence:

in order to (to V), While (if), actually (really), so (therefore), any, at all, as (because, since), both ….. and, closely (intimately), to consider (to analyze), respectively, particular (certain), as (in the process), then (in this case), in some way (somehow), thus (hence), a number of (a set of, a range of), rather (we use ‘rather’ to introduce a correction = instead of)

COMPUTABILITY THEORY & TURING MACHINE

Study the paper and translate the passage marked with asterisks in writing.

The theory of computation is the branch of computer science that deals with whether and how efficiently problems can be solved on a

30