11:00 PM ÅÓÔ

<ÇÅÏÓ-ÔÉÍ> É CAN'T STAY, SO DON'T DO ANYTHING ON MY ACCOUNT

<Ò.ÂÏÙÌÅÓ2> É AM NOT KNOWLEDGABLE ENOUGH FOR YOU TO TAKE THE TIME FOR ME ONLY!

<ÇÅÏÓ-ÔÉÍ> ×ELL, É WOULD THINK THIS COULD BE QUITE AN OPPORTUNITY TO LEARN AT
THE LEVEL YOU ARE AT

<[ÔONY] Á.ÔÏÌÌÅ> ×ELL, ARE YOU WILLING TO LEARN?  ÄO YOU HAVE ANY ÂÁÓÉÃ
PROGRAMMING EXPERIENCE?

<ÇÅÏÓ-ÔÉÍ> ÏNE ON ONE IS A GREAT WAY TO LEARN

<Ò.ÂÏÙÌÅÓ2> É AM CURIOUS ONLY, AND HAVE ABSOLUTELY NO COMPREHENSION AT ALL.

<ÇÅÏÓ-ÔÉÍ> ×ELL, É'M GOING.....TURNING IN EARLY.....GOOD LUCK.:Ä

<[ÔONY] Á.ÔÏÌÌÅ> ÏK, 'NIGHT ÔIM.

<ÇÅÏÓ-ÔÉÍ> ÎIGHT

<ÇÅÏÓ-ÔÉÍ> ::::::ÐÏÏÆ::::::

<[ÔONY] Á.ÔÏÌÌÅ> É GUESS É WILL START FROM THE BEGINNING...

<Ò.ÂÏÙÌÅÓ2> ÉT WOULD BE BETTER IF YOU HAD AN AUDIENCE OF SOME EXPERIENCED
PEOPLE.

** <ÇÅÏÓ-ÔÉÍ> HAS LEFT.

<[ÔONY] Á.ÔÏÌÌÅ> ÎO THATS OK...  É THINK MAYBE ITS BETTER IF É DON'T HAVE TO
HURRY THE LESSON ALONG FOR MORE ADVANCED PEOPLE.

<[ÔONY] Á.ÔÏÌÌÅ> ÌET ME START AT THE VERY BASIC STUFF...  ÆROM WHEN YOU FIRST
TURN THE COMPUTER ON TO THE TIME YOU TURN IT OFF IT IS ALWAYS RUNNING A
COMPUTER PROGRAM, WHICH IS A SET OF SPECIAL "INSTRUCTIONS" WHICH TELL THE
COMPUTER WHAT TO.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHESE COMPUTER PROGRAMS RESIDE IN THE COMPUTER'S MEMORY,
WHICH IS A FINITE AMOUNT OF INFORMATION THAT IS STORED IN UNITS CALLED BYTES.
ÆOLLOWING ME SO FAR?

<Ò.ÂÏÙÌÅÓ2> YES

<Ò.ÂÏÙÌÅÓ2> ÉLL STOP YOU IF É NEED FURTHER INT.

<[ÔONY] Á.ÔÏÌÌÅ> Á BYTE IS A BASIC UNIT OF MEMORY STORAGE, AND IS COMPRISED OF
8 "BITS" WHICH ARE LIKE DIGITS IN A NUMBER.  Á BIT CAN BE EITHER OFF OR ON, OR
YOU COULD SAY IT COULD BE A 0 OR A 1.  ÔHE REASON A BIT CAN HAVE ONLY TWO
STATES IS THAT THE ELECTRICAL CHARGES THAT CONSTITUTE THE COMPUTER'S MEMORY
CAN EITHER BE "ON" OR "OFF" AND NOTHING IN BETWEEN, SO ONE ELECTRICAL PULSE IS
THE VERY SMALLEST UNIT OF INFORMATION THAT THE COMPUTER CAN STORE.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHIS _COULD_ BE A LIMITATION, EXCEPT THAT IF YOU PUT MORE
THAN ONE BIT TOGETHER YOU CAN CREATE LARGER NUMBERS, JUST AS WITH OUR OWN
"DECIMAL" NUMBER SYSTEM WHERE WE USE MORE DIGITS FOR HIGHER NUMBERS.

<[ÔONY] Á.ÔÏÌÌÅ> ÓAY YOU HAD A BINARY NUMBER (A NUMBER COMPRISED OF BITS), AND
YOU ONLY HAD 1 DIGIT.  ÙOU WOULD HAVE TWO COMBINATIONS: 0 AND 1

<[ÔONY] Á.ÔÏÌÌÅ> ÏK, SO THEN SAY YOU HAD A BINARY NUMBER COMPRISED OF TWO
DIGITS, THEN YOU WOULD HAVE FOUR COMBINATIONS: 00 01 10 AND 11.

<[ÔONY] Á.ÔÏÌÌÅ> ÎEXT...  ÉF YOU HAD A BINARY NUMBER COMPRISED OF THREE
DIGITS, THEN YOU WOULD HAVE 8 COMBINATIONS: 000 001 010 011 100 101 110 AND
111.

<[ÔONY] Á.ÔÏÌÌÅ> Á "BYTE" IS COMPRISED OF 8 BINARY DIGITS, SO IT CAN HAVE 256
DIFFERENT COMINATIONS.

<[ÔONY] Á.ÔÏÌÌÅ> Á BINARY NUMBER CAN BE CONVERTED TO DECIMAL AND VISA VERSA:
ÅACH DIGIT IN A BINARY NUMBER REPRESENTS A POWER OF TWO (JUST AS EACH DIGIT IN
A DECIMAL NUMBER REPRESENTS A POWER OF 10)...

<[ÔONY] Á.ÔÏÌÌÅ> ÉN DECIMAL YOU HAVE THE 1'S DIGIT, THE 10'S DIGIT, THE 100'S
DIGIT...  ÉN THE NUMBER 398, THE 8 IS THE 1'S DIGIT, THE 9 IS THE 10'S DIGIT,
AND THE 3 IS THE 100'S DIGIT, BECAUSE IT IS THE SAME AS SAYING THE NUMBER IS
3X100 PLUS 9X10 PLUS 8.

<[ÔONY] Á.ÔÏÌÌÅ> ÉN BINARY YOU HAVE A 1'S DIGIT, A TWO'S DIGIT, A FOUR'S
DIGIT, AN 8'S DIGIT AND SO ON.  ÓO THE NUMBER 111 WOULD BE 1 TIMES 4, PLUS 1
TIMES 2, PLUS 1 TIMES 1, OR 7.

<[ÔONY=] Á.ÔÏÌÌÅ> ÁS YOU MOVE FROM 1 DIGIT TO THE NEXT FROM RIGHT TO LEFT, THE
VALUE OF THE COLUMN MULTIPLIES BY 2, JUST AS IN DECIMAL NUMBERS IT MULTIPLIES
BY 10.

<[ÔONY] Á.ÔÏÌÌÅ> ÁNOTHER EXAMPLE:  ÔO CONVERT THE NUMBER 10 TO BINARY.  ÆIRST,
THE LARGEST MULTIPLE OF 2 THAT WOULD GO INTO 10 IS 8.  ÓO THERE WOULD BE A 1
IN THE 8'S DIGIT: 1000 SO FAR.  ÔHE REMAINER WOULD BE 2, WHICH MEANS THERE
WOULD BE A 1 IN THE 2'S DIGIT:  THE FINAL BINARY NUMBER IS 1010.   ÉN OTHER
WORDS, 1 TIMES 8, PLUS 0 TIMES 4, PLUS 1 TIMES 2, PLUS 0 TIMES 1.

<[ÔONY] Á.ÔÏÌÌÅ> ÆOLLOWING ME SO FAR?

<Ò.ÂÏÙÌÅÓ2> TO A POINT

<[ÔONY] Á.ÔÏÌÌÅ> ÏK... ×ELL, É WILL MOVE ON TO MEMORY NOW THEN.   ÔHE MEMORY
OF THE ÃOMMODORE IS DIVIDED INTO A CERTAIN NUMBER OF THESE BYTES, THERE ARE
65536 OF THEM TO BE EXACT.

<[ÔONY] Á.ÔÏÌÌÅ> ÅACH BYTE HAS ITS OWN "ADDRESS" NUMBERED FROM 0 TO 65535.
ÔHE REASON THAT THERE ARE THIS MANY BYTES IS THAT IS EXACTLY HOW MANY
COMBINATIONS (OR DIFFERENT NUMBERS) THAT YOU CAN REPRESENT USING JUST TWO
BYTES.

<[ÔONY] Á.ÔÏÌÌÅ> ÓO IT TAKES AT LEAST TWO BYTES TO REPRESENT AN ADDRESS IN THE
COMPUTER'S MEMORY.

<[ÔONY] Á.ÔÏÌÌÅ> Á MORE CONVENIENT WAY TO REPRESENT AN ADDRESS WITHOUT USING
BINARY NUMBERS IS TO USE SOMETHING CALLED HEXADECIMAL NUMBERS.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHIS IS ALMOST IN CONTRAST TO THE COMPARISON BETWEEN BINARY
AND DECIMAL.  ×ITH BINARY AND DECIMAL, YOU NEEDED MORE BINARY DIGITS THAN
DECIMAL DIGITS TO REPRESENT A NUMBER (LIKE THE NUMBER 255 IN DECIMAL IS
11111111 IN BINARY).

<[ÔONY] Á.ÔÏÌÌÅ> ÉN CONTRAST, YOU NEED MORE DECIMAL DIGITS THAN HEXADECIMAL
DIGITS TO REPRESENT A NUMBER.  ÆOR EXAMPLE, THE HEXADECIMAL NUMBER ÆÆÆÆ WOULD
BE 65535 IN DECIMAL.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE REASON FOR THIS IS THAT THERE ARE 16 DIFFERENT
HEXADECIMAL DIGITS (INSTEAD OF 10 DIGITS LIKE DECIMAL), AND THE DIGITS ARE 0,
1, 2, 3, 4, 5, 6, 7, 8, 9, Á, Â, Ã, Ä, Å, Æ.  ÎOTICE THAT THE LETTERS Á
THROUGH Æ ARE USED TO REPRESENT THE HEXADECIMAL DIGITS ABOVE 9.

<Ò.ÂÏÙÌÅÓ2> WAIT

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE REASON HEXADECIMAL NOTATION IS USED OFTEN IS BECAUSE WHEN
YOU THINK IN TERMS OF HEXADECIMAL YOU CAN THINK MORE LIKE THE COMPUTER DOES.

<[ÔONY] Á.ÔÏÌÌÅ> OK.

<Ò.ÂÏÙÌÅÓ2> CAN YOU BE LESS SPECIFIC - TELL ME, 1.WHAT IS MEMORY PURPOSE,2.
HOW IS MEMORY USED TO COMPUTER FUNCTION

<[ÔONY] Á.ÔÏÌÌÅ> ÏK...  ÔHE PURPOSE OF THE COMPUTER'S MEMORY IS TO HAVE A
PLACE TO STORE THE COMPUTER'S PROGRAMMING AND THE DATA THE THE PROGRAMS USE TO
FUNCTION.  ÉF YOU DIDN'T HAVE ANY COMPUTER MEMORY THEN THE COMPUTER WOULD HAVE
NO WAY OF KNOWING WHAT TO DO.

<[ÔONY] Á.ÔÏÌÌÅ> ÅACH LOCATION OF MEMORY CAN STORE ONE BYTE, OR CHARACTER, OF
INFORMATION.  ÓAY YOU ARE TYPING IN SOME TEXT IN A WORD PROCESSOR, THEN EACH
LETTER OF WHAT YOU ARE TYPING IS STORED IN ITS OWN BYTE IN MEMORY.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE WORD PROCESSOR IS A PROGRAM THAT ALSO EXISTS IN MEMORY,
BECAUSE THE COMPUTER UNDERSTANDS CERTAIN PATTERNS OF BYTES AS "INSTRUCTIONS"
THAT TELL IT TO DO THINGS LIKE PUT A LETTER ON THE SCREEN FOR EXAMPLE.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE WORD PROCESSOR PROGRAM KEEPS TRACK OF WHERE IT HAS STORED
YOUR CHARACTERS IN MEMORY AND CAN DISPLAY THEM ON THE SCREEN OR PRINT THEM OR
DO WHATEVER THAT YOU TELL THE PROGRAM TO DO WITH THE INFORMATION.

<Ò.ÂÏÙÌÅÓ2> WHAT WOULD THE LETTER A LOOK LIKE?

<[ÔONY] Á.ÔÏÌÌÅ> ×ELL, A LETTER WOULD BE A PATTERN OF BITS IN A BYTE.  ÙOU
COULDN'T ACTUALLY SEE A BYTE BECAUSE IT IS JUST A COLLECTION OF ELECTRICAL
PULSES, BUT YOU CAN REPRESENT ONE WITH A BINARY NUMBER.  ÉT WAS AGREED A LONG
TIME AGO ON A STANDARD FOR THE BINARY PATTERNS WHICH WOULD REPRESENT LETTERS.
ÔHE LETTER "Á" FOR EXAMPLE IS REPRESENTED BY THE PATTERN 01000001, WHICH IS 65
IN DECIMAL.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE NAME OF THIS STANDARD OF PATTERNS IS ÁÓÃÉÉ, WHICH STANDS
FOR ÁMERICAN ÓTANDARD ÃODE FOR ÉNFORMATION ÉNTERCHANGE.

<Ò.ÂÏÙÌÅÓ2> IS EVERY LETTERSTORED AS AN E/PULSE

<[ÔONY] Á.ÔÏÌÌÅ> ÅVERYTHING IN MEMORY IS JUST A COLLECTION OF ELECTRICAL
PULSES, BUT BY THE CLEVER USE OF PROGRAMMING AND THINGS LIKE VIDEO CHIPS, WE
ARE ALLOWED TO SEE THE LETTERS AS WE CAN UNDERSTAND THEM, BECAUSE THE COMPUTER
CONVERTS THESE BINARY PATTERNS INTO THE SHAPES OF THE LETTERS.

<[ÔONY] Á.ÔÏÌÌÅ> ÂUT THE BYTE IN MEMORY IS THE MOST BASIC STRUCTURE OF
INFORMATION, AND THE COMPUTER CAN NEVER UNDERSTAND WHAT THE LETTER "Á" IS,
BECAUSE IT WILL ALWAYS SEE IT AS A PATTERN OF BITS.

<Ò.ÂÏÙÌÅÓ2> YES

<Ò.ÂÏÙÌÅÓ2> RELATE THIS TO RAM-ROM

<[ÔONY] Á.ÔÏÌÌÅ> ÏK...  ÒÁÍ STANDS FOR ÒANDOM ÁCCESS ÍEMORY, WHICH IS THE
MEMORY IN THE COMPUTER THAT IT CAN BOTH "READ" AND "WRITE" (OR CHANGE)

<[ÔONY] Á.ÔÏÌÌÅ> ÒÏÍ, ON THE OTHER HAND IS "ÒEAD ÏNLY ÍEMORY" WHICH IS THE
SECTIONS OF MEMORY THAT THE COMPUTER CAN ONLY "READ", BECAUSE THE INFORMATION
IS PERMANENTLY BURNT ONTO SPECIAL ÒÏÍ CHIPS.

<Ò.ÂÏÙÌÅÓ2> ROM PURPOSE EXAMPLE.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE REASON THAT A COMPUTER NEEDS ÒÏÍ IS THAT IT LOSES ALL
INFORMATION STORED IN ÒÁÍ AS SOON AS IT LOSES POWER, SO IT NEEDS SOME BUILT IN
MEMORY WITH PROGRAMMING IN IT TO TELL IT WHAT TO DO WHEN YOU TURN THE COMPUTER
ON.

<Ò.ÂÏÙÌÅÓ2> YES

<[ÔONY] Á.ÔÏÌÌÅ> ÒÁÍ REQUIRES POWER TO "KEEP ITS SHAPE", WHILE ÒÏÍ WILL BE
THERE WHETHER THERE IS POWER OR NOT.  ÔHAT IS WHY YOU LOSE YOUR OWN TYPED
INFORMATION WHEN POWER IS LOST, BECAUSE IT WAS STORED IN ÒÁÍ.

<Ò.ÂÏÙÌÅÓ2> HOW RELATE TO 8 BIT 16 BIT.

<[ÔONY] Á.ÔÏÌÌÅ> 8 BITS IS THE NUMBER OF BITS IN A BYTE, WHICH IS A UNIT OF
MEMORY (ONE CHARACTER LIKE THE LETTER "A" CAN BE STORED IN A BYTE).   16 BITS
IS THE NUMBER OF BITS IN A MEMORY ADDRESS.  ×ITH 16 BITS YOU CAN HAVE 65536
COMBINATIONS, WHICH IS THE NUMBER OF BYTES IN THE COMPUTER'S MEMORY.  ÅACH
BYTE HAS ITS OWN UNIQUE ADDRESS FROM 0 TO 65535.

<Ò.ÂÏÙÌÅÓ2> GIVE ME A ELEMENTARY EXPL OF ADDRESS

<[ÔONY] Á.ÔÏÌÌÅ> ÙOU CAN THINK OF AN ADDRESS AS A NUMBERED CONTAINER WHICH
STORES ONE BYTE (ONE CHARACTER) OF INFORMATION.  ×HEN THE COMPUTER WANTS TO
KNOW WHAT IS STORED IN MEMORY IT USES A THE NUMBER TO FIND THE CONTAINER
HOLDING THE BYTE IT NEEDS, JUST LIKE A POST OFFICE WORKER USES OUR HOUSE
ADDRESS TO FIND OUT WHERE TO DELIVER AND PICK UP MAIL.

<[ÔONY] Á.ÔÏÌÌÅ> ÁND YOU CAN ALSO THINK OF THESE CONTAINERS AS BEING SIDE BY
SIDE SITTING IN ONE LONG ROW, JUST LIKE A LONG ROW OF HOUSES ON ONE STREET
WITH ADDRESSES 0 TO 65535.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHE PROGRAMS THAT ARE IN THE MEMORY USE SPECIAL THINGS CALLED
"REGISTERS," WHICH ARE A BUILT IN WAY OF KEEPING TRACK OF WHERE IN MEMORY THE
INFORMATION IS BEING READ FROM OR WRITTEN TO.

<Ò.ÂÏÙÌÅÓ2> ARE ADDRESSES ALL SAME -ARE THEY ASSIGNED CERTAIN NON CHANGEABLE
FUNCTIONS?

<[ÔONY] Á.ÔÏÌÌÅ> ×ELL, THE ÃOMMODORE'S MEMORY IS DIVIDED UP INTO SPECIFIC
AREAS OF FUNCTION.  ÂUT THIS DIVISION IS COMPLETELY ARBITRARY AND WAS DESIGNED
INTO THE ÃOMMODORE.  ÉF IT WEREN'T FOR THIS INHERENT DESIGN, THEN EACH BYTE
WOULD BE UNIQUE ONLY BY ITS ADDRESS AND NO OTHER REASON.  ÂUT THANKFULLY,
SPECIAL AREAS OF MEMORY HAVE BEEN BUILT IN SO THAT WE DO NOT NEED TO "REDESIGN
THE WHEEL" EACH TIME WE WANT TO WRITE A PROGRAM.

<[ÔONY] Á.ÔÏÌÌÅ> ÆOR EXAMPLE, ADDRESSES 53248 TO 53503 IS THE AREA OF THE
COMPUTER'S MEMORY RESERVED FOR THE USE OF THE VIDEO CHIP ÔHE COMPUTER READS
FROM AND WRITES TO THIS AREA OF MEMORY TO TELL THE VIDEO CHIP TO DO SPECIAL
THINGS LIKE CHANGE THE COLOR OF THE SCREEN OR DISPLAY A SPRITE.

<[ÔONY] Á.ÔÏÌÌÅ> ÓOME OTHER AREAS OF MEMORY ARE SPECIAL ONLY BECAUSE OF THE
BUILT IN PROGRAMMING, UNLIKE THE VIDEO CHIP AREA.  ÌOCATIONS 512 TO 827, FOR
EXAMPLE, ARE USED BY THE COMPUTER TO STORE INFORMATION LIKE WHAT THE USER IS
TYPING, THE CURRENT CURSOR COLOR TO PRINT, AND OTHER USEFUL INFORMATION.

<Ò.ÂÏÙÌÅÓ2> IS THIS ARBITRARY DESIGN UNIQUE TO CBM.

<[ÔONY] Á.ÔÏÌÌÅ> ×HAT É WAS JUST TELLING YOU ABOUT IS LIMITED TO THE C64, BUT
ALL COMPUTERS ARE DESIGNED IN BASICALLY THE SAME WAY, WITH GENERAL PURPOSE
MEMORY AND SPECIAL PURPOSE MEMORY INHERENTLY DESIGNED INTO THE SYSTEM.

<[ÔONY] Á.ÔÏÌÌÅ> ×ELP, IT LOOKS LIKE THE HOUR IS UP, ARE THERE ANY OTHER
QUESTIONS YOU HAVE BEFORE É END TONIGHT'S LESSON?

<[ÔONY] Á.ÔÏÌÌÅ> ÁRE YOU BEGINNING TO UNDERSTAND THE FUNCTION AND PURPOSE OF
MEMORY?

** <Ò.ÂÏÙÌÅÓ2> DISCONNECTED.

** <Ò.ÂÏÙÌÅÓ2> IS HERE.

<[ÔONY] Á.ÔÏÌÌÅ> ÄID YOU CATCH WHAT É LAST SAID BEFORE YOU LEFT?

<Ò.ÂÏÙÌÅÓ2> DID YOU GET ANY OF MY LINES?

<Ò.ÂÏÙÌÅÓ2> GOT LOCKED UP

<[ÔONY] Á.ÔÏÌÌÅ> ×HAT WAS THE LAST THING YOU REMEMBER ME SAYING?

<Ò.ÂÏÙÌÅÓ2> RIGHT AFTER ARBITRARY ASIGN OF - BY CBM

<Ò.ÂÏÙÌÅÓ2> ÉDN/LDED THEN JUST STOPPED!

<[ÔONY] Á.ÔÏÌÌÅ> ÙES.  ÃOMMODORE HAS ITS OWN DESIGN, WHILE OTHER COMPUTERS
WILL BE DIFFERENT.  ÂUT ALL COMPUTERS WILL HAVE BOTH GENERAL PURPOSE MEMORY
AND SPECIFIC PURPOSE MEMORY.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHEN É SAID THAT THE HOUR WAS UP FOR THE CLASS AND É ASKED IF
YOU HAD ANY MORE QUESTIONS BEFORE É END THE LESSON?

<Ò.ÂÏÙÌÅÓ2> WAS JUST THANKING U 4 TIME

<[ÔONY] Á.ÔÏÌÌÅ> ÁRE YOU BEGINNING TO UNDERSTAND THE FUNCTION AND PURPOSE OF
COMPUTER MEMORY?

<Ò.ÂÏÙÌÅÓ2> U HELPED TREMENDOUSLY!!!!!!!!!!

<[ÔONY] Á.ÔÏÌÌÅ> ÔHATS GOOD TO HEAR.  ÔHANKS FOR THE FEEDBACK.  É AM GLAD YOU
WERE HERE TO PARTICIPATE.

<Ò.ÂÏÙÌÅÓ2> WAS É A BORE?

<[ÔONY] Á.ÔÏÌÌÅ> ÎO, YOU ASKED QUESTIONS, AND É ACTUALLY PREFER THAT SOMEONE
INTERACTS BY ASKING QUESTIONS THAN FOR ME TO JUST BE TALKING.

<Ò.ÂÏÙÌÅÓ2> 1 LAST QUESTION?

<[ÔONY] Á.ÔÏÌÌÅ> ÇO AHEAD, ÒOB.

<Ò.ÂÏÙÌÅÓ2> É GET THE EXPLANATION OF ML, HOW IS THE UNDERSTANDING OF ML
RELATED TO PROGRAMMING?

<[ÔONY] Á.ÔÏÌÌÅ> ÙOU MEAN HOW IS ÍACHINE ÌANGUAGE RELATED TO PROGRAMMING?

<Ò.ÂÏÙÌÅÓ2> YES

<[ÔONY] Á.ÔÏÌÌÅ> ×ELL, ÍACHINE ÌANGUAGE, OR ÍÌ, IS THE SPECIAL SET OF BYTES
THAT THE COMPUTER USES AS ITS OWN "LANGUAGE".  ÙOU PROGRAM BY PUTTING THESE
INSTRUCTIONS IN MEMORY AND THEN TELLING THE COMPUTER TO EXECUTE THEM.

<[ÔONY] Á.ÔÏÌÌÅ> É MEAN TO SAY... ÐROGRAMMING IS THE PROCESS OF PUTTING
ÍACHINE ÌANGUAGE INSTRUCTIONS INTO MEMORY AND TELLING THE COMPUTER TO EXECUTE
THE INSTRUCTIONS YOU HAVE PLACED THERE.

<Ò.ÂÏÙÌÅÓ2> BUT YOU DON'T THINK ML WHEN YOU PROGRAM DO YOU

<[ÔONY] Á.ÔÏÌÌÅ> ÕSUALLY YOU DON'T HAVE TO MEMORIZE THE NUMBERS FOR THE ÍÌ
INSTRUCTIONS.  ÔHAT IS WHY YOU USE A TOOL CALLED A MONITOR OR AN ÁSSEMBLER TO
HELP YOU PROGRAM.

<[ÔONY] Á.ÔÏÌÌÅ> Á MONITOR WILL ALLOW YOU TO PROGRAM SIMPLE ÍÌ PROGRAMS BY
LETTING YOU TYPE INSTRUCTIONS CALLED MNEMONICS, WHICH IS JUST TECHICAL JARGON
FOR ABBREVIATIONS.

<[ÔONY] Á.ÔÏÌÌÅ> ÆOR EXAMPLE, YOU WOULD TYPE ÌÄÁ #5 AND THAT WOULD BE
CONVERTED BY THE MONITOR PROGRAM TO THE NUMBERS 169 AND 5, WHICH IS A MACHINE
LANGUAGE INSTRUCTION.

<Ò.ÂÏÙÌÅÓ2> ÁRE GOING TO CONTINUE ML - É AM HUNGRY FOR MORE INFO!

<[ÔONY] Á.ÔÏÌÌÅ> YES, I WILL CONTINUE THE CLASSES.

<Ò.ÂÏÙÌÅÓ2> AREN'T ALL PROGRAMS ML PROGRAMS?

<[ÔONY] Á.ÔÏÌÌÅ> YES, WHEN IT COMES DOWN TO IT, ALL PROGRAMS ARE IN ÍÌ, ITS
JUST THAT WHEN YOU PROGRAM IN ÂÁÓÉÃ, THE TEXT YOU ENTER IS CONVERTED INTO CODE
WHICH IS IN TURN "INTERPRETED" BY THE ÂÁÓÉÃ ÒÏÍ WHICH EXECUTES THE APPROPRIATE
ÍÌ ROUTINES.

** <Ã.ÇÒÉÆÏÒ> IS HERE.

** <[ÃHUCK] Ã.ÇÒÉÆÏÒ> WAS <Ã.ÇÒÉÆÏÒ>.

<[ÔONY] Á.ÔÏÌÌÅ> ÔHUS A ÐÒÉÎÔ STATEMENT IS A SHORTCUT WAY TO EXECUTE AN ÍÌ
ROUTINE IN MEMORY THAT IS BUILT INTO THE COMPUTER, SO YOU DON'T HAVE TO WRITE
THE COMPLEX ÍÌ PROGRAM THAT WOULD DO THE WORK OF THE ÐÒÉÎÔ COMMAND.

<[ÔONY] Á.ÔÏÌÌÅ> ÒE'S ÃHUCK.

<[ÃHUCK] Ã.ÇÒÉÆÏÒ> ÒE'S; STILL IN THE LESSON SESSION?

<[ÔONY] Á.ÔÏÌÌÅ> ×E WERE JUST FINISHING UP TONIGHTS LESSON, ÃHUCK.

<[ÔONY] Á.ÔÏÌÌÅ> ÂÁÓÉÃ IS CALLED A HIGH LEVEL LANGUAGE, BECAUSE YOU DON'T HAVE
TO UNDERSTAND THE WAY THAT THE COMPUTER IS RUNNING (IN ÍÌ) TO USE THE
LANGUAGE, ALTHOUGH WHEN IT BOILS DOWN TO IT, ALL ÂÁÓÉÃ IS IS A COLLECTION OF
ÍÌ ROUTINES!

<Ò.ÂÏÙÌÅÓ2> É'M GOING TO BED! AND MANY THANKS-É'M NOT TO SURE YOU HAVEN'T
CREATED A MONSTER!

<[ÔONY] Á.ÔÏÌÌÅ> ÏK...  'ÎIGHT ÒOB...  ÔHANKS AGAIN FOR PARTICIPATING.

<Ò.ÂÏÙÌÅÓ2> É AM NOT TO SURE É NEED TO KNOW THIS MUCH.

<[ÔONY] Á.ÔÏÌÌÅ> ÏK, É WILL END IT AT THAT THEN, ÒOB.  ÊUST REMEMBER WHAT É
SAID ABOUT MEMORY AND HOW ÍÌ FITS INTO PROGRAMMING.

<[ÔONY] Á.ÔÏÌÌÅ> É WILL ATTEMPT TO CONDENSE OUR DISCUSSION AND UPLOAD IT SO
THAT ANYONE CAN DOWNLOAD THE FILE AND VIEW IT.

<Ò.ÂÏÙÌÅÓ2> GOT IT DOWN/LDED.

<Ò.ÂÏÙÌÅÓ2> THANKS AGAIN I THINK!!

<[ÔONY] Á.ÔÏÌÌÅ> ÏK, YOU ARE WELCOME ÒOB, AND É WILL BE HERE EVERY ÔHURSDAY
FOR THE LESSONS.

<[ÔONY] Á.ÔÏÌÌÅ> ÎEXT WEEKS LESSON WILL BE AT 10:30 ÅÓÔ THOUGH!

<[ÔONY] Á.ÔÏÌÌÅ> ÔHOUGH YOU CAN STOP IN ANYTIME BETWEEN 10:00 PM ÅÓÔ AND 1 AM
ÅÓÔ THOUGH ON ÔHURSDAYS AND ASK QUESTIONS.

<Ò.ÂÏÙÌÅÓ2> WILL BE HERE.

<Ò.ÂÏÙÌÅÓ2> É ALSO THINK THAT YOU ARE NOT OF THIS WORLD!

<[ÔONY] Á.ÔÏÌÌÅ> ÁNY LAST QUESTIONS BEFORE YOU GO?  ÔO CLEAR UP ANY OTHER
CONFUSION?

<Ò.ÂÏÙÌÅÓ2> NOPE.

<[ÔONY] Á.ÔÏÌÌÅ> ×HY DO YOU SAY THAT, ÒOB... ÁM É THAT CONFUSING?  HEHEHEHEH
:)

<[ÃHUCK] Ã.ÇÒÉÆÏÒ> ÏË, WELL JUST PASSING THROUGH--SOMEDAY É'LL HAVE TO LEARN
PROGRAMMING--É'VE GOT ÇEOS PROGRAMMER.

<[ÔONY] Á.ÔÏÌÌÅ> ÙOU ARE WELCOME TO STAY ÃHUCK.

<Ò.ÂÏÙÌÅÓ2> ANYONE WHO CAN EXPLAIN ML IS AN ALIEN.

** <Å.ÂÏÕÒÄÏÎ1> IS HERE.

** <[ÅDDIE] Å.ÂÏÕÒÄÏÎ1> WAS <Å.ÂÏÕÒÄÏÎ1>.

<[ÃHUCK] Ã.ÇÒÉÆÏÒ> ÍY WIFE'S GETTING READY TO DRAG ME OFF--SO GOODNIGHT ALL

** <Ò.ÂÏÙÌÅÓ2> HAS LEFT.