The following is a conversation with Donald Knuth,

one of the greatest and most impactful computer scientists

and mathematicians ever.

He's the recipient of the 1974 Turing Award,

considered the Nobel Prize of Computing.

He's the author of the multi volume work,

the Magnum Opus, The Art of Computer Programming.

He made several key contributions

to the rigorous analysis of computational complexity

of algorithms, including the popularization

of asymptotic notation, that we all affectionately

know as the big O notation.

He also created the tech typesetting system,

which most computer scientists, physicists, mathematicians,

and scientists and engineers in general

use to write technical papers and make them look beautiful.

I can imagine no better guest to end 2019 with than Don,

one of the kindest, most brilliant people in our field.

This podcast was recorded many months ago.

It's one I avoided because perhaps counterintuitively,

the conversation meant so much to me.

If you can believe it, I knew even less

about recording back then, so the camera angle is a bit off.

I hope that's OK with you.

The office space was a big cramp for filming,

but it was a magical space where Don does most of his work.

It meant a lot to me that he would welcome me into his home.

It was quite a journey to get there.

As many people know, he doesn't check email,

so I had to get creative.

The effort was worth it.

I've been doing this podcast on the side

for just over a year.

Sometimes I had to sacrifice a bit of sleep,

but always happy to do it and to be

part of an amazing community of curious minds.

Thank you for your kind words of support

and for the interesting discussions,

and I look forward to many more of those in 2020.

This is the Artificial Intelligence Podcast.

If you enjoy it, subscribe on YouTube,

give it five stars on Apple Podcast, follow on Spotify,

support on Patreon, or simply connect with me on Twitter

at Lex Friedman, spelled F R I D M A N.

I recently started doing ads at the end of the introduction.

I'll do one or two minutes after introducing the episode

and never any ads in the middle that break

the flow of the conversation.

I hope that works for you

and doesn't hurt the listening experience.

I provide timestamps for the start of the conversation

that you can skip to, but it helps

if you listen to the ad and support this podcast

by trying out the product or service being advertised.

This show is presented by Cash App,

the number one finance app in the App Store.

I personally use Cash App to send money to friends,

but you can also use it to buy, sell,

and deposit Bitcoin in just seconds.

Cash App also has a new investing feature.

You can buy fractions of a stock, say $1 worth,

no matter what the stock price is.

Broker services are provided by Cash App Investing,

a subsidiary of Square and member SIPC.

I'm excited to be working with Cash App

to support one of my favorite organizations called First,

best known for their first robotics and Lego competitions.

They educate and inspire hundreds of thousands of students

in over 110 countries and have a perfect rating

on Charity Navigator, which means that donated money

is used to maximum effectiveness.

When you get Cash App from the App Store or Google Play

and use code LexPodcast, you'll get $10

and Cash App will also donate $10 to First,

which again is an organization

that I've personally seen inspire girls and boys

to dream of engineering a better world.

And now here's my conversation with Donald Knuth.

In 1957 at Case Tech, you were once allowed

to spend several evenings with a IBM 650 computer

as you've talked about in the past

and you fell in love with computing then.

Can you take me back to that moment with the IBM 650?

What was it that grabbed you about that computer?

So the IBM 650 was this machine

that, well, it didn't fill a room,

but it was big and noisy.

But when I first saw it, it was through a window

and there were just a lot of lights flashing on it.

And I was a freshman, I had a job with the statistics group

and I was supposed to punch cards for data

and then sort them on another machine,

but then they got this new computer, came in

and it had interesting lights, okay.

So, well, but I had a key to the building

so I could get in and look at it and got a manual for it.

And my first experience was based on the fact

that I could punch cards, basically,

which is a big thing for the,

but the IBM 650 was big in size,

but incredibly small in power.

In resources.

In memory, it had 2,000 words of memory

and a word of memory was 10 decimal digits plus a sign.

And it would do, to add two numbers together,

you could probably expect that would take,

I'll say three milliseconds.

So.

It took pretty fast, the memory is the constraint,

the memory is the problem.

That was why it took three milliseconds,

because it took five milliseconds for the drum to go around

and you had to wait, I don't know, five cycle times.

If you have an instruction, one position on the drum,

then it would be ready to read the data for the instruction

and go three notches.

The drum is 50 cycles around and you go three cycles

and you can get the data and then you can go

another three cycles and get to your next instruction

if the instruction is there, otherwise you spin

until you get to the right place.

And we had no random access memory whatsoever

until my senior year.

Senior year, we got 50 words of random access memory

which were priceless and we would move stuff

up to the random access memory in 60 word chunks

and then we would start again.

So subroutine wanted to go up there.

Could you have predicted the future 60 years later

of computing from then?

You know, in fact, the hardest question I was ever asked

was what could I have predicted?

In other words, the interviewer asked me,

she said, you know, what about computing has surprised you?

And immediately I ran, I rattled off a couple dozen things

and then she said, okay, so what didn't surprise?

And I tried for five minutes to think of something

that I would have predicted and I couldn't.

But let me say that this machine, I didn't know,

well, there wasn't much else in the world at that time.

The 650 was the first machine that there were more

than a thousand of ever.

Before that there were, you know, each machine

there might be a half a dozen examples,

maybe a couple dozen.

The first mass market, mass produced.

The first one, yeah, done in quantity.

And IBM didn't sell them, they rented them,

but they rented them to universities that had a great deal.

And so that's why a lot of students learned

about computers at that time.

So you refer to people, including yourself,

who gravitate toward a kind of computational thinking

as geeks, at least I've heard you use that terminology.

It's true that I think there's something

that happened to me as I was growing up

that made my brain structure in a certain way

that resonates with computers.

So there's this space of people, 2% of the population,

you empirically estimate.

That's been fairly constant over most of my career.

However, it might be different now

because kids have different experiences when they're young.

Obviously.

So what does the world look like to a geek?

What is this aspect of thinking that is unique to,

that makes a geek?

This is a hugely important question.

In the 50s, IBM noticed that there were geeks

and nongeeks, and so they tried to hire geeks.

And they put out ads with papers saying,

if you play chess, come to Madison Avenue

for an interview or something like this.

They were trying for some things.

So what is it that I find easy

and other people tend to find harder?

And I think there's two main things.

One is this, is the ability to jump levels

of abstraction.

So you see something in the large

and you see something in the small

and you pass between those unconsciously.

So you know that in order to solve some big problem,

what you need to do is add one to a certain register

and that gets you to another step.

And below the, I don't go down to the electron level,

but I knew what those milliseconds were,

what the drum was like on the 650.

I knew how I was gonna factor a number

or find a root of an equation or something

because of what was doing.

And as I'm debugging, I'm going through,

did I make a key punch error?

Did I write the wrong instruction?

Do I have the wrong thing in a register?

And each level is different.

And this idea of being able to see something

at lots of levels and fluently go between them

seems to me to be much more pronounced

in the people that resonate with computers like I do.

So in my books, I also don't stick just to the high level,

but I mix low level stuff with high level

and this means that some people think

that I should write better books and it's probably true.

But other people say, well, but that's,

if you think like that, then that's the way

to train yourself, keep mixing the levels

and learn more and more how to jump between.

So that's the one thing.

The other thing is that it's more of a talent

to be able to deal with non uniformity

where there's case one, case two, case three,

instead of having one or two rules that govern everything.

So it doesn't bother me if I need,

like an algorithm has 10 steps to it,

each step does something else that doesn't bother me,

but a lot of pure mathematics is based on one or two rules

which are universal and so this means

that people like me sometimes work with systems

that are more complicated than necessary

because it doesn't bother us that we didn't figure out

the simple rule.

And you mentioned that while Jacobi, Boole, Abel,

all the mathematicians in the 19th century

may have had symptoms of geek,

the first 100% legit geek was Turing, Alan Turing.

I think he had, yeah, a lot more of this quality

than anybody, just from reading the kind of stuff he did.

So how does Turing, what influence has Turing had on you

in your way of thinking?

I didn't know that aspect of him

until after I graduated some years.

As undergraduate we had a class that talked about

computability theory and Turing machines

and it was all, it sounded like a very specific kind

of purely theoretical approach to stuff.

So when, how old were they when I learned

that he had a design machine and that he wrote a wonderful

manual for Manchester machines and he invented

all kinds of subroutines and he was a real hacker

that he had his hands dirty.

I thought for many years that he had only done

purely formal work, as I started reading

his own publications, I could feel this kinship

and of course he had a lot of peculiarities,

like he wrote numbers backwards because I mean,

left to right instead of right to left

because that's, it was easier for computers

to process them that way.

What do you mean left to right?

He would write pi as 9, 5, 1, 4.3, I mean, okay.

Right, got it.

4, 1.3, on the blackboard.

I mean, he had trained himself to do that

because the computers he was working with

worked that way inside.

Trained himself to think like a computer.

There you go, that's geek thinking.

You've practiced some of the most elegant

formalism in computer science and yet you're

the creator of a concept like literate programming

which seems to move closer to natural language

type of description of programming.

Yeah, absolutely.

How do you see those two as conflicting

as the formalism of theory and the idea

of literate programming?

So there we are in a nonuniform system

where I don't think one size fits all

and I don't think all truth lies in one kind of expertise.

And so somehow, in a way you'd say my life

is a convex combination of English and mathematics.

And you're okay with that.

And not only that, I think.

Thrive in it.

I wish, you know, I want my kids to be that way,

I want, et cetera, you know, use left brain,

right brain at the same time.

You got a lot more done.

That was part of the bargain.

And I've heard that you didn't really read

for pleasure until into your 30s, you know, literature.

That's true.

You know more about me than I do

but I'll try to be consistent with what you read.

Yeah, no, just believe me.

I just go with whatever story I tell you.

It'll be easier that way.

The conversation works.

Right, yeah, no, that's true.

So I've heard mention of Philip Roth's American Pastoral,

which I love as a book.

I don't know if, it was mentioned as something,

I think, that was meaningful to you as well.

In either case, what literary books

had a lasting impact on you?

What literature, what poetry?

Yeah, okay, good question.

So I met Roth.

Oh, really?

Well, we both got doctors from Harvard on the same day,

so we had lunch together and stuff like that.

But he knew that, you know, computer books would never sell.

Well, all right, so you say you were a teenager

when you left Russia, so I have to say

that Tolstoy was one of the big influences on me,

especially like Anna Karnina,

not because of particularly of the plot of the story,

but because there's this character who,

you know, the philosophical discussions,

the whole way of life is worked out there

among the characters,

and so that I thought was especially beautiful.

On the other hand, Dostoevsky, I didn't like at all

because I felt that his genius was mostly

because he kept forgetting what he had started out to do,

and he was just sloppy.

I didn't think that he polished his stuff at all,

and I tend to admire somebody

who dots the I's and crosses the T's.

So the music of the pros is what you admire more than...

I certainly do admire the music of the language,

which I couldn't appreciate in the Russian original,

but I can in Victor Hugo, because French is closer.

But Tolstoy, I like the same reason.

I like Herman Wouk as a novelist.

I think like his book, Marjorie Morningstar,

has a similar character in Hugo

who developed his own personal philosophy,

and it goes in the...

What's consistent?

Yeah, right, and it's worth pondering.

So, yeah.

So you don't like Nietzsche, and...

Like what?

You don't like Friedrich Nietzsche, or...

Nietzsche, yeah, no, no, yeah, this has...

I keep seeing quotations from Nietzsche,

and he never tempt me to read any further.

Well, he's full of contradictions,

and you will certainly not appreciate him.

But Schiller, I'm trying to get across

what I appreciate in literature,

and part of it is, as you say,

the music of the language, the way it flows,

and take Raymond Chandler versus Dashiell Hammett.

Dashiell Hammett's sentences are awful,

and Raymond Chandler's are beautiful, they just flow.

So I don't read literature

because it's supposed to be good for me,

or because somebody said it's great,

but I find things that I like.

I mean, you mentioned you were dressed like James Bond,

so I love Ian Fleming.

I think he had a really great gift for...

If he has a golf game, or a game of bridge,

or something and this comes into his story,

it'll be the most exciting golf game,

or the absolute best possible hands of bridge that exists,

and he exploits it and tells it beautifully.

So in connecting some things here,

looking at literate programming

and being able to convey in code algorithms

to a computer in a way that mimics how humans speak,

what do you think about natural language in general

and the messiness of our human world,

about trying to express difficult things?

So the idea of literate programming

is really to try to understand something better

by seeing it from at least two perspectives,

the formal and the informal.

If we're trying to understand a complicated thing,

if we can look at it in different ways.

And so this is in fact the key to technical writing,

a good technical writer trying not to be obvious about it,

but says everything twice, formally and informally,

or maybe three times, but you try to give the reader

a way to put the concept into his own brain

or her own brain.

Is that better for the writer or the reader or both?

Well, the writer just tries to understand the reader.

That's the goal of a writer,

is to have a good mental image of the reader

and to say what the reader expects next

and to impress the reader with what has impressed the writer

why something is interesting.

So when you have a computer program,

we try to, instead of looking at it as something

that we're just trying to give instruction to the computer,

what we really wanna be is giving insight

to the person who's gonna be maintaining this program

or to the programmer himself when he's debugging it

as to why this stuff is being done.

And so all the techniques of exposition

that a teacher uses or a book writer uses

make you a better programmer

if your program is gonna be not just a one shot deal.

So how difficult is that?

Do you see hope for the combination of informal and formal

for the programming task?

Yeah, I'm the wrong person to ask, I guess,

because I'm a geek, but I think for a geek it's easy.

Some people have difficulty writing

and that might be because there's something

in their brain structure that makes it hard

for them to write or it might be something

just that they haven't had enough practice.

I'm not the right one to judge,

but I don't think you can teach any person

any particular skill.

I do think that writing is half of my life

and so I put it together in a literate program.

Even when I'm writing a one shot program,

I write it in a literate way

because I get it right faster that way.

Now does it get compiled automatically?

Or?

So I guess on the technical side, my question was

how difficult is it to design a system

where much of the programming is done informally?

Informally?

Yeah, informally.

I think whatever works to make it understandable is good,

but then you have to also understand how informal is.

You have to know the limitations.

So by putting the formal and informal together,

this is where it gets locked into your brain.

You can say informally, well,

I'm working on a problem right now, so.

Let's go there.

Can you give me an example of connecting

the informal and the formal?

Well, it's a little too complicated an example.

There's a puzzle that's self referential.

It's called a Japanese arrow puzzle.

And you're given a bunch of boxes.

Each one points north, east, south, or west.

And at the end, you're supposed to fill in each box

with the number of distinct numbers that it points to.

So if I put a three in a box, that means that,

and it's pointing to five other boxes,

that means that there's gonna be three different numbers

in those five boxes.

And those boxes are pointing,

one of them might be pointing to me,

one of them might be pointing the other way.

But anyway, I'm supposed to find a set of numbers

that obeys this complicated condition

that each number counts how many distinct numbers

it points to.

And so a guy sent me his solution to this problem

where he presents formal statements

that say either this is true or this is true

or this is true.

And so I try to render that formal statement informally

and I try to say, I contain a three

and the guys I'm pointing to contain the numbers one,

two, and six.

So by putting it informally and also I convert it

into a dialogue statement,

that helps me understand the logical statement

that he's written down as a string of numbers

in terms of some abstract variables that he had.

That's really interesting.

So maybe an extension of that,

there has been a resurgence in computer science

and machine learning and neural networks.

So using data to construct algorithms.

So it's another way to construct algorithms, really.

Yes, exactly.

If you can think of it that way.

So as opposed to natural language to construct algorithms,

use data to construct algorithms.

So what's your view of this branch of computer science

where data is almost more important

than the mechanism of the algorithm?

It seems to be suited to a certain kind of non geek,

which is probably why it's taken off.

It has its own community that really resonates with that.

But it's hard to trust something like that

because nobody, even the people who work with it,

they have no idea what has been learned.

That's a really interesting thought

that it makes algorithms more accessible

to a different community, a different type of brain.

Yep.

And that's really interesting

because just like literate programming perhaps

could make programming more accessible

to a certain kind of brain.

There are people who think it's just a matter of education

and anybody can learn to be a great programmer.

Anybody can learn to be a great skier.

I wish that were true,

but I know that there's a lot of things

that I've tried to do and I was well motivated

and I kept trying to build myself up

and I never got past a certain level.

I can't view, for example,

I can't view three dimensional objects in my head.

I have to make a model and look at it

and study it from all points of view

and then I start to get some idea.

But other people are good at four dimensions.

Physicists.

Yeah.

So let's go to the art of computer programming.

In 1962, you set the table of contents

for this magnum opus, right?

Yep.

It was supposed to be a single book with 12 chapters.

Now today, what is it, 57 years later,

you're in the middle of volume four of seven?

In the middle of volume four B is.

Four B.

More precisely.

Can I ask you for an impossible task,

which is try to summarize the book so far

maybe by giving a little examples.

So from the sorting and the search

and the combinatorial algorithms,

if you were to give a summary, a quick elevator summary.

Elevator, that's great.

Yeah, right.

But depending how many floors there are in the building.

Yeah.

The first volume called Fundamental Algorithms

talks about something that you can't,

the stuff you can't do without.

You have to know the basic concepts of what is a program,

what is an algorithm.

And it also talks about a low level machine

so you can have some kind of an idea what's going on.

And it has basic concepts of input and output

and subroutines.

Induction.

Induction, right.

Mathematical, preliminary.

So the thing that makes my book different

from a lot of others is that I try to,

not only present the algorithm,

but I try to analyze them,

which means quantitatively I say,

not only does it work, but it works this fast.

Okay, and so I need math for that.

And then there's the standard way to structure data inside

and represent information in the computer.

So that's all volume one.

Volume two talks, it's called Seminumerical Algorithms.

And here we're writing programs,

but we're also dealing with numbers.

Algorithms deal with any kinds of objects,

but specific when there's objects or numbers,

well then we have certain special paradigms

that apply to things that involve numbers.

And so there's arithmetic on numbers

and there's matrices full of numbers,

there's random numbers,

and there's power series full of numbers.

There's different algebraic concepts

that have numbers in structured ways.

And arithmetic in the way a computer

would think about arithmetic, so floating point.

Floating point arithmetic, high precision arithmetic,

not only addition, subtraction, multiplication,

but also comparison of numbers.

So then volume three talks about.

I like that one, sorting and search.

Sorting and search. I love sorting.

Right, so here we're not dealing necessarily with numbers

because you sort letters and other objects

and searching we're doing all the time with Google nowadays,

but I mean, we have to find stuff.

So again, algorithms that underlie

all kinds of applications.

None of these volumes is about a particular application,

but the applications are examples

of why people want to know about sorting,

why people want to know about random numbers.

So then volume four goes into combinatorial algorithm.

This is where we have zillions of things to deal with

and here we keep finding cases where one good idea

can make something go more than a million times faster.

And we're dealing with problems

that are probably never gonna be solved efficiently,

but that doesn't mean we give up on them

and we have this chance to have good ideas

and go much, much faster on them.

So that's combinatorial algorithms

and those are the ones that are,

I mean, you said sorting is most fun for you.

It's true, it's fun, but combinatorial algorithms

are the ones that I always enjoyed the most

because that's when my skillet programming had most payoff.

The difference between an obvious algorithm

that you think up first thing and an interesting,

subtle algorithm that's not so obvious,

but run circles around the other one,

that's where computer science really comes in.

And a lot of these combinatorial methods

were found first in applications

to artificial intelligence or cryptography.

And in my case, I just liked them

and it was associated more with puzzles.

Do you like them most in the domain of graphs

and graph theory?

Graphs are great because they're terrific models

of so many things in the real world

and you throw numbers on a graph,

you got a network and so there you have many more things.

But combinatorial in general is any arrangement

of objects that has some kind of higher structure,

nonrandom structure and is it possible

to put something together satisfying all these conditions?

Like I mentioned arrows a minute ago,

is there a way to put these numbers

on a bunch of boxes that are pointing to each other?

Is that gonna be possible at all?

That's volume four.

That's volume four.

What does the future hold?

Volume four A was part one.

And what happened was in 1962,

when I started writing down a table of contents,

it wasn't gonna be a book

about computer programming in general,

it was gonna be a book about how to write compilers.

And I was asked to write a book

explaining how to write a compiler.

And at that time, there were only a few dozen people

in the world who had written compilers

and I happened to be one of them.

And I also had some experience writing

for like the campus newspaper and things like that.

So I said, okay, great.

I'm the only person I know who's written a compiler

but hasn't invented any new techniques

for writing compilers.

And all the other people I knew had super ideas

but I couldn't see that they would be able to write a book

that would describe anybody else's ideas with their own.

So I could be the journalist and I could explain

what all these cool ideas about compiler writing were.

And then I started putting down,

well, yeah, you need to have a chapter

about data structures.

You need to have some introductory material.

I wanna talk about searching

because a compiler writer has to look up the variables

in a symbol table and find out which,

when you write the name of a variable in one place,

it's supposed to be the same

as the one you put somewhere else.

So you need all these basic techniques

and I kinda know some arithmetic and stuff.

So I threw in these chapters

and I threw in a chapter on combinatorics

because that was what I really enjoyed programming the most

but there weren't many algorithms known

about combinatorial methods in 1962.

So that was a kind of a short chapter

but it was sort of thrown in just for fun.

And chapter 12 was gonna be actual compilers,

applying all the stuff in chapters one to 11

to make compilers.

Well, okay, so that was my table of contents from 1962.

And during the 70s, the whole field of combinatorics

went through a huge explosion.

People talk about a combinatorial explosion

and they usually mean by that that the number of cases

goes up, you know, you change end to end plus one

and all of a sudden your problem

has gotten more than 10 times harder.

But there was an explosion of ideas

about combinatorics in the 70s to the point

that like take 1975, I bet you more than half

of all the journals of computer science

were about combinatorial methods.

What kind of problems were occupying people's minds?

What kind of problems in combinatorics?

Was it satisfiability, graph theory?

Yeah, graph theory was quite dominant.

I mean, but all of the NP hard problems

that you have like Hamiltonian path.

Travel salesman.

Going beyond graphs, you had operation research

whenever there was a small class of problems

that had efficient solutions and they were usually

associated with matron theory,

special mathematical construction.

But once we went to things that involve

three things at a time instead of two,

all of a sudden things got harder.

So we had satisfiability problems where if you have clauses,

every clause has two logical elements in it,

then we can satisfy it in linear time.

We can test for satisfiability in linear time,

but if you allow yourself three variables in the clause,

then nobody knows how to do it.

So these articles were about trying to find better ways

to solve cryptography problems and graph theory problems.

We have lots of data, but we didn't know how to find

the best subsets of the data.

Like with sorting, we could get the answer.

Didn't take long.

So how did it continue to change from the 70s to today?

Yeah, so now there may be half a dozen conferences

whose topic is combinatorics, a different kind,

but fortunately I don't have to rewrite my book every month

like I had to in the 70s.

But still there's huge amount of work being done

and people getting better ideas on these problems

that don't seem to have really efficient solutions,

but we still do a lot more with them.

And so this book that I'm finishing now is,

I've got a whole bunch of brand new methods

that as far as I know, there's no other book

that covers this particular approach.

And so I'm trying to do my best of exploring

the tip of the iceberg and I try out lots of things

and keep rewriting as I find better method.

So what's your writing process like?

What's your thinking and writing process like every day?

What's your routine even?

Yeah, I guess it's actually the best question

because I spend seven days a week doing it.

You're the most prepared to answer it.

Yeah, but okay.

So the chair I'm sitting in is where I do...

It's where the magic happens.

Well, reading and writing, the chair is usually

sitting over there where I have other books,

some reference books, but I found this chair

which was designed by a Swedish guy anyway.

It turns out this is the only chair I can really sit in

for hours and hours and not know that I'm in a chair.

But then I have the standup desk right next to us

and so after I write something with pencil and eraser,

I get up and I type it and revise and rewrite.

I'm standing up.

The kernel of the idea is first put on paper.

Yeah.

Right.

And I'll write maybe five programs a week,

of course, literate programming.

And these are, before I describe something in my book,

I always program it to see how it's working

and I try it a lot.

So for example, I learned at the end of January,

I learned of a breakthrough by four Japanese people

who had extended one of my methods in a new direction.

And so I spent the next five days writing a program

to implement what they did.

And then they had only generalized part of what I had done

so then I had to see if I could generalize more parts of it.

And then I had to take their approach

and I had to try it out on a couple of dozen

of the other problems I had already worked out

with my old methods.

And so that took another couple of weeks.

And then I started to see the light

and I started writing the final draft

and then I would type it up,

involve some new mathematical questions.

And so I wrote to my friends

who might be good at solving those problems

and they solved some of them.

So I put that in as exercises.

And so a month later, I had absorbed one new idea

that I learned and I'm glad I heard about it in time.

Otherwise, I wouldn't put my book out

before I'd heard about the idea.

On the other hand, this book was supposed to come in

at 300 pages and I'm up to 350 now.

That added 10 pages to the book.

But if I learn about another one,

my publisher is gonna shoot me.

Well, so in that process, in that one month process,

are some days harder than others?

Are some days harder than others?

Well, yeah, my work is fun, but I also work hard

and every big job has parts

that are a lot more fun than others.

And so many days I'll say,

why do I have to have such high standards?

Why couldn't I just be sloppy and not try this out

and just report the answer?

But I know that people are calling me to do this

and so, okay, so, okay, Don, I'll grit my teeth and do it.

And then the joy comes out when I see that actually,

I'm getting good results and I get even more

when I see that somebody has actually read

and understood what I wrote

and told me how to make it even better.

I did wanna mention something about the method.

So I got this tablet here, where I do the first,

the first writing of concepts, okay, so.

And what language is that in?

Right, so take a look at it, but you know,

here, random say, explain how to draw

such skewed pixel diagrams, okay, so.

I got this paper about 40 years ago

when I was visiting my sister in Canada

and they make tablets of paper with this nice large size

and just the right.

A very small space between lines.

Small spaces, yeah, yeah, take a look.

Maybe also just show it.

Yeah.

Yeah.

Wow.

You know, I've got these manuscripts

going back to the 60s.

And those are where I'm getting my ideas on paper, okay.

But I'm a good typist.

In fact, I went to typing school when I was in high school

and so I can type faster than I think.

So then when I do the editing, stand up and type,

then I revise this and it comes out a lot different

than what, you know, for style and rhythm

and things like that come out at the typing stage.

And you type in tech.

And I type in tech.

And can you think in tech?

No.

So.

To a certain extent, I have only a small number of idioms

that I use.

Like, you know, I'm beginning with theorem,

I do something for displayed equation,

I do something and so on.

But I have to see it and.

In the way that it's on paper here.

Yeah, right.

So for example, Turing wrote, what, The Other Direction.

You don't write macros, you don't think in macros.

Not particularly, but when I need a macro,

I'll go ahead and do it.

But the thing is, I also write to fit.

I mean, I'll change something if I can save a line.

You know, it's like haiku.

I'll figure out a way to rewrite the sentence

so that it'll look better on the page.

And I shouldn't be wasting my time on that,

but I can't resist because I know it's only another 3%

of the time or something like that.

And it could also be argued that

that is what life is about.

Ah, yes, in fact, that's true.

Like, I work in the garden one day a week

and that's kind of a description of my life

is getting rid of weeds, you know,

removing bugs for programs.

So, you know, a lot of writers talk about,

you know, basically suffering, the writing processes,

having, you know, it's extremely difficult.

And I think of programming, especially,

or technical writing that you're doing can be like that.

Do you find yourself, methodologically,

how do you every day sit down to do the work?

Is it a challenge?

You kind of say it's, you know, it's fun.

But it'd be interesting to hear if there are non fun parts

that you really struggle with.

Yeah, so the fun comes when I'm able to put together

ideas of two people who didn't know about each other.

And so I might be the first person

that saw both of their ideas.

And so then, you know, then I get to make the synthesis

and that gives me a chance to be creative.

But the dredge work is where I've got to chase everything

down to its root.

This leads me into really interesting stuff.

I mean, I learn about Sanskrit and I try to give credit

to all the authors.

And so I write to people who know the authors

if they're dead or I communicate this way.

And I got to get the math right.

And I got to tackle all my programs,

try to find holes in them.

And I rewrite the programs after I get a better idea.

Is there ever dead ends?

Oh yeah, I throw stuff out, yeah.

One of the things that I spend a lot of time preparing,

a major example based on the game of baseball.

And I know a lot of people for whom baseball

is the most important thing in the world.

But I also know a lot of people for whom cricket

is the most important in the world or soccer or something.

You know, and I realized that if I had a big example,

I mean, it was gonna have a fold out illustration

and everything.

And I was saying, well, what am I really teaching

about algorithms here where I had this baseball example?

And if I was a person who knew only cricket,

wouldn't they, what would they think about this?

And so I've ripped the whole thing out.

But I had something that would have really appealed

to people who grew up with baseball

as a major theme in their life.

Which is a lot of people, but still a minority.

Small minority, I took out bowling too.

Even a smaller minority.

What's the art in the art of programming?

Why is there, of the few words in the title,

why is art one of them?

Yeah, well, that's what I wrote my Turing lecture about.

And so when people talk about art,

it really, I mean, what the word means is

something that's not in nature.

So when you have artificial intelligence,

art comes from the same root,

saying that this is something

that was created by human beings.

And then it's gotten a further meaning often of fine art,

which has this beauty to the mix.

And so we have things that are artistically done,

and this means not only done by humans,

but also done in a way that's elegant and brings joy.

And has, I guess,

Tolstoy versus Dostoevsky going back.

But anyway, it's that part that says

that it's done well, as well as not only different

from nature.

In general, then, art is what human beings

are specifically good at.

And when they say artificial intelligence,

well, they're trying to mimic human beings.

But there's an element of fine art and beauty.

You are one.

That's what I try to also say,

that you can write a program and make a work of art.

So now, in terms of surprising,

what ideas in writing from search

to the combinatorial algorithms,

what ideas have you come across

that were particularly surprising to you

that changed the way you see a space of problems?

I get a surprise every time I have a bug

in my program, obviously.

But that isn't really what you're at.

More transformational than surprising.

For example, in volume 4A,

I was especially surprised when I learned

about data structure called BDD,

Boolean Decision Diagram.

Because I sort of had the feeling

that as an old timer,

and I've been programming since the 50s,

and BDDs weren't invented until 1986.

And here comes a brand new idea that revolutionizes

the way to represent a Boolean function.

And Boolean functions are so basic

to all kinds of things in,

I mean, logic is, underlies it.

Everything we can describe,

all of what we know in terms of logic somehow,

and propositional logic,

I thought that was cut and dried

and everything was known.

But here comes

Randy Bryant

and discovers that BDDs are incredibly powerful.

Then, so that means I have a whole new section

to the book that I never would have thought of

until 1986, not even until 1990s,

when people started to use it

for a billion dollar of applications.

And it was the standard way to design computers

for a long time,

until SAT solvers came along in the year 2000.

So that's another great big surprise.

So a lot of these things have totally changed

the structure of my book.

And the middle third of volume 4B is about SAT solvers,

and that's 300 plus pages,

which is all about material,

mostly about material that was discovered in this century.

And I had to start from scratch

and meet all the people in the field

and write 15 different SAT solvers

that I wrote while preparing that.

Seven of them are described in the book.

Others were from my own experience.

So newly invented data structures

or ways to represent?

A whole new class of algorithm.

Whole new class of algorithm.

Yeah, and the interesting thing about the BDDs

was that the theoreticians started looking at it

and started to describe all the things

you couldn't do with BDDs.

And so they were getting a bad name

because, okay, they were useful,

but they didn't solve every problem.

I'm sure that the theoreticians are,

in the next 10 years,

are gonna show why machine learning

doesn't solve everything.

But I'm not only worried about the worst case,

I get a huge delight when I can actually solve a problem

that I couldn't solve before.

Even though I can't solve the problem

that it suggests is a further problem,

I know that I'm way better than I was before.

And so I found out that BDDs could do

all kinds of miraculous things.

And so I had to spend quite a few years

learning about that territory.

So in general, what brings you more pleasure?

Proving or showing a worst case analysis of an algorithm

or showing a good average case

or just showing a good case?

That something good,

pragmatically can be done with this algorithm.

Yeah, I like a good case

that is maybe only a million times faster

than I was able to do before.

But, and not worry about the fact

that it's still gonna take too long

if I double the size of the problem.

So that said, you popularized the asymptotic notation

for describing running time,

obviously in the analysis of algorithms.

Worst case is such an important part.

Do you see any aspects of that kind of analysis

as lacking and notation too?

Well, the main purpose should have notations

that help us for the problems we wanna solve.

And so they match our intuitions.

And people who worked in number theory

had used asymptotic notation in a certain way,

but it was only known to a small group of people.

And I realized that, in fact,

it was very useful to be able to have a notation

for something that we don't know exactly what it is,

but we only know partial about it.

And so instead, so for example,

instead of big O notation,

let's just take a much simpler notation

where I'd say zero or one, or zero, one or two.

And suppose that when I had been in high school,

we would be allowed to put in the middle of our formula,

X plus zero, one or two equals Y, okay?

And then we would learn how to multiply

two such expressions together and deal with them.

Well, the same thing big O notation says,

here's something that's, I'm not sure what it is,

but I know it's not too big.

I know it's not bigger than some constant times N squared

or something like that.

So I write big O of N squared.

And now I learned how to add big O of N squared

to big O of N cubed.

And I know how to add big O of N squared to plus one

and square that and how to take logarithmic exponentials

where I have big O's in the middle of them.

And that turned out to be hugely valuable

in all of the work that I was trying to do

as I'm trying to figure out how good an algorithm is.

So have there been algorithms in your journey

that perform very differently in practice

than they do in theory?

Well, the worst case of a combinatorial algorithm

is almost always horrible.

But we have SAT solvers that are solving,

where one of the last exercises in that part of my book

was to figure out a problem that has 100 variables

that's difficult for a SAT solver.

But you would think that a problem

with 100 billion variables has,

requires you to do two to the 100th operations

because that's the number of possibilities

when you have 100 billion variables in two to the 100th.

Two to the 100th is way bigger than we can handle.

10 to the 17th is a lot.

You've mentioned over the past few years

that you believe P may be equal to NP,

but that it's not really,

if somebody does prove that P equals NP,

it will not directly lead to an actual algorithm

to solve difficult problems.

Can you explain your intuition here?

Has it been changed?

And in general, on the difference between

easy and difficult problems of P and NP and so on?

Yeah, so the popular idea is if an algorithm exists,

then somebody will find it.

And it's just a matter of writing it down.

But many more algorithms exist

than anybody can understand or ever make use of.

Or discover, yeah.

Because they're just way beyond human comprehension.

The total number of algorithms is more than mind boggling.

So we have situations now

where we know that algorithms exist,

but we don't have the farthest idea what the algorithms are.

There are simple examples based on game playing

where you have, where you say,

well, there must be an algorithm that exists

to win in the game of Hex because,

for the first player to win in the game of Hex

because Hex is always either a win

for the first player or the second player.

Well, what's the game of Hex?

There's a game of Hex which is based

on putting pebbles onto a hexagonal board

and the white player tries to get a white path

from left to right and the black player tries

to get a black path from bottom to top.

And how does capture occur?

Just so I understand.

And there's no capture.

You just put pebbles down one at a time.

But there's no draws because after all the white

and black are played, there's either gonna be a white path

across from east to west or a black path from bottom to top.

So there's always, it's the perfect information game

and people take turns like tic tac toe.

And the hex board can be different sizes.

But anyway, there's no possibility of a draw

and players move one at a time.

And so it's gotta be either a first player win

or a second player win.

Mathematically, you follow out all the trees

and either there's always a win for the first player,

second player, okay.

And it's finite.

The game is finite.

So there's an algorithm that will decide.

You can show it has to be one or the other

because the second player could mimic the first player

with kind of a pairing strategy.

And so you can show that it has to be one way or the other.

But we don't know any algorithm anyway.

We don't know the third or the fourth.

There are cases where you can prove the existence

of a solution but nobody knows any way how to find it.

But more like the algorithm question,

there's a very powerful theorem in graph theory

by Robinson and Seymour that says that every class

of graphs that is closed under taking minors

has a polynomial time algorithm to determine

whether it's in this class or not.

Now a class of graphs, for example, planar graphs.

These are graphs that you can draw in a plane

without crossing lines.

And a planar graph, taking minors means

that you can shrink an edge into a point

or you can delete an edge.

And so you start with a planar graph

and shrink any edge to a point is still planar.

Delete an edge is still planar.

Okay, now, but there are millions of different ways

to describe a family of graph that still remains

the same under taking minor.

And Robertson and Seymour proved that any such family

of graphs, there's a finite number of minimum graphs

that are obstructions so that if it's not in the family,

then it has to contain, then there has to be a way

to shrink it down until you get one

of these bad minimum graphs that's not in the family.

In the case of a planar graph, the minimum graph

is a five pointed star where everything points to another

and the minimum graph consisting of trying

to connect three utilities to three houses

without crossing lines.

And so there are two bad graphs that are not planar

and every non planar graph contains one

of these two bad graphs by shrinking and removing edges.

Sorry, can you say it again?

So he proved that there's a finite number

of these bad graphs.

There's always a finite number.

So somebody says, here's a family.

It's hard to believe.

And they present a sequence of 20 papers.

I mean, it's deep work, but it's.

Because that's for any arbitrary class.

So for any arbitrary class that's closed

under taking minors.

That's closed under, maybe I'm not understanding

because it seems like a lot of them

are closed under taking minors.

Almost all the important classes of graphs are.

There are tons of such graphs, but also hundreds

of them that arise in applications.

I have a book over here called classes of graphs

and it's amazing how many different classes

of graphs that people have looked at.

So why do you bring up this theorem or this proof?

So now there are lots of algorithms that are known

for special class of graphs.

For example, if I have a certain, if I have a chordal graph

then I can color it efficiently.

If I have some kind of graphs, it'll make a great network.

So you'd like to test, somebody gives you a graph

and says, oh, is it in this family of graphs?

If so, then I can go to the library

and find an algorithm that's gonna solve my problem

on that graph.

Okay, so we wanna have a graph that says,

an algorithm that says,

you give me a graph, I'll tell you whether it's in this

family or not, okay?

And so all I have to do is test whether or not

that does this given graph have a minor,

that's one of the bad ones.

A minor is everything you can get by shrinking

and removing edges.

And given any minor, there's a polynomial time algorithm

saying, I can tell whether this is a minor of you.

And there's a finite number of bad cases.

So I just try, does it have this bad case?

Polynomial time, I got the answer.

Does it have this bad case?

Polynomial time, I got the answer.

Total polynomial time.

And so I've solved the problem.

However, all we know is that the number of minors is finite.

We don't know what, we might only know one or two

of those minors, but we don't know if we've got a,

if we've got 20 of them, we don't know,

there might be 21, 25, there's just some,

all we know is that it's finite.

So here we have a polynomial time algorithm

that we don't know.

That's a really great example of what you worry about

or why you think P equals NP won't be useful.

But still, why do you hold the intuition that P equals NP?

P equals NP because you have to rule out

so many possible algorithms as being not working.

You can take the graph and you can represent it

as in terms of certain prime numbers,

and then you can multiply those together,

and then you can take the bitwise AND

and construct some certain constant in polynomial time.

And then that's perfectly valid algorithm.

And there's so many algorithms of that kind.

A lot of times we see random,

take data and we get coincidences

that some fairly random looking number actually is useful

because it happens to solve a problem

just because there's so many hairs on your head.

But it seems like unlikely that two people

are gonna have the same number of hairs on their head.

But they're obvious, but you can count

how many people there are and how many hairs on the head.

There must be people walking around in the country

that have the same number of hairs on their head.

Well, that's a kind of a coincidence

that you might say also this particular combination

of operations just happens to prove

that the graph has a Hamiltonian path.

I see lots of cases where unexpected things happen

when you have enough possibilities.

So because the space of possibility is so huge,

your intuition just says it's not.

You have to rule them all out.

And so that's the reason for my intuition.

It's by no means a proof.

I mean, some people say, well, P can't equal NP

because you've had all these smart people.

The smartest designers of algorithms

have been racking their brains for years and years

and there's million dollar prizes out there

and none of them, nobody has thought of the algorithm.

So there must be no such algorithm.

On the other hand, I can use exactly the same logic

and I can say, well, P must be equal to NP

because there's so many smart people out here

have been trying to prove it unequal to NP

and they've all failed.

This kind of reminds me of the discussion

about the search for aliens.

They've been trying to look for them

and we haven't found them yet, therefore they don't exist.

But you can show that there's so many planets out there

that they very possibly could exist.

Yeah, right, and then there's also the possibility

that they exist but they all discovered machine learning

or something and then blew each other up.

Well, on that small, quick tangent, let me ask,

do you think there's intelligent life

out there in the universe?

I have no idea.

Do you hope so?

Do you think about it?

I don't spend my time thinking about things

that I could never know, really.

And yet you do enjoy the fact that there's many things

you don't know.

You do enjoy the mystery of things.

I enjoy the fact that I have limits, yeah.

But I don't take time to answer unsolvable questions.

Got it.

Well, because you've taken on some tough questions

that may seem unsolvable.

You have taken on some tough questions

that may seem unsolvable, but they're in the space.

It gives me a thrill when I can get further

than I ever thought I could, yeah.

But much like with religion, these.

I'm glad that there's no proof that God exists or not.

I mean, I think.

It would spoil the mystery.

It would be too dull, yeah.

So to quickly talk about the other art

of artificial intelligence, what's your view?

Artificial intelligence community has developed

as part of computer science and in parallel

with computer science since the 60s.

What's your view of the AI community from the 60s to now?

So all the way through, it was the people

who were inspired by trying to mimic intelligence

or to do things that were somehow

the greatest achievements of intelligence

that had been inspiration to people

who have pushed the envelope of computer science

maybe more than any other group of people.

So all the way through, it's been a great source

of good problems to sink teeth into.

Sink teeth into and getting partial answers

and then more and more successful answers over the years.

So this has been the inspiration

for lots of the great discoveries of computer science.

Are you yourself captivated by the possibility

of creating, of algorithms having echoes

of intelligence in them?

Not as much as most of the people in the field, I guess,

I would say, but that's not to say that they're wrong

or that it's just, you asked about my own personal

preferences, but the thing that I worry about

is when people start believing that they've actually

succeeded and because the, it seems to me,

there's a huge gap between really understanding something

and being able to pretend to understand something

and give the illusion of understanding something.

Do you think it's possible to create without understanding?

Yeah.

So to.

Oh, I do that all the time too, I mean.

So I use random numbers, but there's still this great gap.

I don't assert that it's impossible,

but I don't see anything coming any closer

to really the kind of stuff

that I would consider intelligence.

So you've mentioned something that,

on that line of thinking, which I very much agree with,

so The Art of Computer Programming as the book

is focused on single processor algorithms,

and for the most part, you mentioned.

That's only because I set the table of contents in 1962,

you have to remember.

For sure, there's no.

I'm glad I didn't wait until 1965 or something.

That's, one book, maybe we'll touch on the Bible,

but one book can't always cover the entirety of everything.

So I'm glad the table of contents

for The Art of Computer Programming is what it is.

But you did mention that you thought

that an understanding of the way ant colonies

are able to perform incredibly organized tasks

might well be the key to understanding human cognition.

So these fundamentally distributed systems.

So what do you think is the difference

between the way Don Knuth would sort a list

and an ant colony would sort a list

or perform an algorithm?

Sorting a list isn't the same as cognition, though,

but I know what you're getting at is.

Well, the advantage of ant colonies,

at least we can see what they're doing.

We know which ant has talked to which other ant,

and it's much harder with the brains

to know to what extent neurons are passing signal.

So I'm just saying that ant colony might be,

if they have the secret of cognition,

think of an ant colony as a cognitive single being

rather than as a colony of lots of different ants.

I mean, just like the cells of our brain

and the microbiome and all that is interacting entities,

but somehow I consider myself to be a single person.

Well, an ant colony, you can say,

might be cognitive somehow.

It's some suggestion.

Yeah, I mean, okay, I smash a certain ant

and the organism's saying, hmm, that stung.

What was that?

But if we're going to crack the secret of cognition,

it might be that we could do so

by psyching out how ants do it

because we have a better chance to measure

their communicating by pheromones

and by touching each other in sight,

but not by much more subtle phenomenon

like electric currents going through.

But even a simpler version of that,

what are your thoughts of maybe Conway's Game of Life?

Okay, so Conway's Game of Life

is able to simulate any computable process.

And any deterministic process is...

I like how you went there.

I mean, that's not its most powerful thing, I would say.

I mean, it can simulate it,

but the magic is that the individual units

are distributed and extremely simple.

Yes, we understand exactly what the primitives are.

The primitives, just like with the ant colony,

even simpler, though.

But still, it doesn't say that I understand life.

I mean, it gives me a better insight

into what does it mean to have a deterministic universe?

What does it mean to have free choice, for example?

Do you think God plays dice?

Yes.

I don't see any reason why God should be forbidden

from using the most efficient ways to...

I mean, we know that dice are extremely important

in efficient algorithms.

There are things that couldn't be done well without randomness.

And so, I don't see any reason why God should be prohibited.

When the algorithm requires it,

you don't see why the physics should constrain it.

So, in 2001, you gave a series of lectures at MIT

about religion and science.

No, that was in 1999.

The book came out in 2001.

So, in 1999, you spent a little bit of time in Boston

enough to give those lectures.

And I read the 2001 version, most of it.

It's quite fascinating to read.

I recommend people, it's a transcription of your lectures.

So, what did you learn about how ideas get started

and grow from studying the history of the Bible?

So, you've rigorously studied a very particular part

of the Bible.

What did you learn from this process

about the way us human beings as a society

develop and grow ideas, share ideas,

and are defined by those ideas?

Well, it's hard to summarize that.

I wouldn't say that I learned a great deal

of really definite things where I could make conclusions,

but I learned more about what I don't know.

You have a complex subject,

which is really beyond human understanding.

So, we give up on saying,

I'm never gonna get to the end of the road

and I'm never gonna understand it,

but you say, but maybe it might be good for me

to get closer and closer

and learn more and more about something.

And so, how can I do that efficiently?

And the answer is, well, use randomness.

And so, try a random subset

of that is within my grasp

and study that in detail,

instead of just studying parts

that somebody tells me to study,

or instead of studying nothing because it's too hard.

So, I decided, for my own amusement once,

that I would take a subset

of the verses of the Bible

and I would try to find out

what the best thinkers have said about that small subset.

And I had about, let's say 60 verses out of 3,000,

I think it's one out of 500 or something like this.

And so, then I went to the libraries,

which are well indexed.

I spent, for example, at Boston Public Library,

I would go once a week for a year

and I went, I have done times to Hanover Harvard Library

to look at this, that weren't in the Boston Public,

where scholars had looked and you can go down the shelves

and you can look in the index and say,

oh, is this verse mentioned anywhere in this book?

If so, look at page 105.

So, in other words, I could learn not only about the Bible,

but about the secondary literature about the Bible,

the things that scholars have written about it.

And so, that gave me a way to zoom in on parts of the thing,

so that I could get more insight.

And so, I look at it as a way of giving me some firm pegs,

which I could hang pieces of information,

but not as things where I would say,

and therefore, this is true.

In this random approach of sampling the Bible,

what did you learn about the most central,

one of the biggest accumulation of ideas in our history?

It seemed to me that the main thrust was not the one

that most people think of as saying,

oh, don't have sex or something like this,

but that the main thrust was to try to figure out

how to live in harmony with God's wishes.

I'm assuming that God exists,

and as I say, I'm glad that there's no way to prove this,

because I would run through the proof once,

and then I'd forget it,

and I would never speculate about spiritual things

and mysteries otherwise,

and I think my life would be very incomplete.

So, I'm assuming that God exists,

but a lot of the people say God doesn't exist,

but that's still important to them.

And so, in a way, that might still be,

whether God is there or not,

in some sense, God is important to them.

One of the verses I studied, Doc,

you can interpret it as saying that it's much better

to be an atheist than not to care at all.

So, I would say it's similar to the P equals NP discussion.

You mentioned a mental exercise that I'd love it

if you could partake in yourself,

a mental exercise of being God.

So, if you were God, Doc Neuth,

how would you present yourself to the people of Earth?

You mentioned your love of literature,

and there's this book that really I can recommend to you.

Yeah, the title, I think, is Blasphemy.

It talks about God revealing Himself

through a computer in Los Alamos,

and it's the only book that I've ever read

where the punchline was really the very last word of the book

and explained the whole idea of the book.

And so, I'd only give that away,

but it's really very much about this question that you raised.

But suppose God said, okay,

my previous means of communication with the world

are not the best for the 21st century,

so what should I do now?

And it's conceivable that God would choose

the way that's described in this book.

Another way to look at this exercise

is looking at the human mind,

looking at the human spirit, the human life in a systematic way.

I think mostly you want to learn humility.

You want to realize that once we solve one problem,

that doesn't mean that all of a sudden other problems are going to drop out.

And we have to realize that there are things beyond our ability.

I see hubris all around.

Yeah, well said.

If you were to run program analysis on your own life,

how did you do in terms of correctness, running time, resource use,

asymptotically speaking, of course?

Okay, yeah, well, I would say

that question has not been asked me before.

And I started out with library subroutines

and learning how to be an automaton that was obedient,

and I had the great advantage that I didn't have anybody to blame for my failures.

If I started not understanding something,

I knew that I should stop playing ping pong,

and it was my fault that I wasn't studying hard enough or something,

rather than that somebody was discriminating against me in some way.

And I don't know how to avoid the existence of biases in the world,

but I know that that's an extra burden that I didn't have to suffer from.

And then I found from parents,

I learned the idea of service to other people

as being more important than what I get out of stuff myself.

I know that I need to be happy enough in order to be able to be of service,

but I came to a philosophy finally that I phrase as,

point eight is enough.

There was a TV show once called Eight is Enough,

which was about somebody had eight kids.

But I say point eight is enough, which means if I can have a way of rating happiness,

I think it's good design to have an organism that's happy about 80% of the time.

And if it was 100% of the time, it would be like everybody's on drugs

and everything collapses and nothing works because everybody's just too happy.

Do you think you've achieved that point eight optimal balance?

There are times when I'm down and I know that I've actually been programmed

to be depressed a certain amount of time.

And if that gets out of kilter and I'm more depressed than usual,

sometimes I find myself trying to think, now, who should I be mad at today?

There must be a reason why.

But then I realize it's just my chemistry telling me that I'm supposed to be mad at somebody,

and so I trigger it up and say, okay, go to sleep and get better.

But if I'm not 100% happy, that doesn't mean that I should find somebody that's screwing me

and try to silence them.

But I'm saying, okay, I'm not 100% happy, but I'm happy enough to be part of a sustainable situation.

So that's kind of the numerical analysis I do.

You've converged towards the optimal, which for human life is a point eight.

I hope it's okay to talk about, as you talked about previously,

in 2006 you were diagnosed with prostate cancer.

Has that encounter with mortality changed you in some way or the way you see the world?

Yeah, it did. The first encounter with mortality was when my dad died,

and I went through a month when I sort of came to be comfortable with the fact that I was going to die someday.

And during that month, I don't know, I felt okay, but I couldn't sing.

And I couldn't do original research either.

I sort of remember after three or four weeks, the first time I started having a technical thought that made sense

and was maybe slightly creative, I could sort of feel that something was starting to move again.

So I felt very empty until I came to grips with it. I learned that this is sort of a standard grief process that people go through.

Okay, so then now I'm at a point in my life, even more so than in 2006,

where all of my goals have been fulfilled except for finishing the art of computer programming.

I had one major unfulfilled goal. I'd wanted all my life to write a piece of music,

and I had an idea for a certain kind of music that I thought ought to be written, at least somebody ought to try to do it.

And I felt that it wasn't going to be easy, but I wanted proof of concept.

I wanted to know if it was going to work or not, and so I spent a lot of time.