so let's actually look at a few I've

written a computer program which doesn't

some sample busy beavers for orders two

three and four probably the best thing I

can start off with now is to show you

the successful a successful order three

in other words a three-card busy beaver

and the results we shown earlier tell us

that when this runs it produces the best

score that a three-card one can produce

so here it goes remember it's a

three-card busy beaver and I want you to

watch how it evolves as the pattern of

Wands develops so let's go back do that

so we are look starting head position on

that very top line parked in the middle

of the tape I'm not sure whether it

needs to go right or left or both the

game starts and evolves at every stage I

put a little caret mark on the

Weatherhead it currently is and this one

is a very nice well-behaved one it moves

about a bit but to give you a nice

contiguous block of ones that's the

first lot here's the second lot and it

finishes it gets into the whole state

the score is six up one two three four

five six ones and the number of steps

which is another important measure of

this particular Turing machine or

visibie virtual machines in general is

how many steps did it take how many

program instructions did it execute to

get to that stage and the answer is 13

okay let's do one more now let's do the

highest order one that's easy to program

up and live with and that is the order

fall one so I'll get out of that I do

apologize for the fact as I've got to

very quickly edit the program because

I've not got it at the moment so that it

drinks in data I'll leave that to you to

do but if I alter the declaration at the

bottom here to say I don't want to run

Turing machine 3a

want to use your machine for this is the

one that should run with a bit of luck

when I've compiled it ok let's do a toss

out on that it should give us 13 ones in

a hundred and seven steps I think there

we go first screen 4 notice how the ones

are developing this time not sticking

together each other to each other quite

as contiguously as they did in the order

3 case but believe me this has been an

selected this is a good one this works

there we are the ones coming together

reboot more now lots of steps there we

are finally the Turing machine has

halted the final tape configuration is

this and there are 13 ones but notice

we've had to invoke the rule that the

ones need not be utterly contiguous

there is an inserted 0 in here but

overall if you count from left to right

there are 13 ones and it took 107 steps

and tebow Rado and his student proved

the 13 in 107 steps is the best you can

do for a 4 card busy beaver