IMF mainframe.

Cisco IBM mainframe

No modem access to a mainframe.

I just extended it.

So, this brings us to the course goals. The course is designed to help you to

But we worship the high hospital on a hill. Right?

So this is a NAND gate.

And from that you have new possibilities for computing.

It's very data intensive experimental science.

I'm a professor at the University of Illinois, Urbana, Champagne.

So, now we can compute that the output arranges material as well as information.

And the problem is we can't afford it today, folks.

We were throwing down the gauntlet.

Free On Line Dictionary of Computing

So this quote wouldn't show up for the keyword David.

But today we have lots of different applications.

The whole industry is moving into heterogeneous computing from mobile to super computing.

We're writing programs to solve problems, but they're dealing with abstract representations of those problems.

It's not quite what he said, but close enough approximation. And when, I don't quite have the graph here.

This is Kernigan and Ritchie inventing UNlX on a PDP.

What we're trying to do is build a virtual world.

Everything is transformed into machine instructions to manipulate these bits.

There's new programmability in these parts.

And computing looks very different.

But we still look at technology as top down mega projects.

The kde team welcomes you to user friendly UNIX computing.

Go through a whole series of things to change my research.

But there is a lot of computing in nature.

The KDE team welcomes you to user friendly UNIX computing.

We'll then go to the next paradigm.

like an immune system, and we're learning from gene regulation and biological development.

So Brielin, what does quantum physics have to do with computing?

Anybody in the world can use them.

I'm here with Brielin Brown, who works on quantum computing.

Illinois Coursera course of Heterogeneous Parallel Programming.

And that's when we got the Internet.

So, one of the reasons it's so challenging to prepare for this Y2K problem is, I want to argue, we have what I would call mainframe poisoning.

log plot is an exponential increase in performance.

So I have quite a few friends who do search engines and I asked one of them, Sergey Brin, who's co founder of Google

Geometry. We haven't used too much directly in this class.

So just to give you a bit of context, as June said, I'm an artist, a technologist and an educator.

We didn't get to this too much in this class, but this question about universality, questions about what can be computed and how fast it can be computed are really fundamental questions about science.

We'll start by summarizing the course, and I want to highlight the three main themes that I think are most important in computing.

And now of days we, of course, have transistors.

This is a student who made a machine that makes machines, and he made it by making Lego bricks that do the computing.