Programming Languages (The Microprocessor's Language)

So, all a computer has in it is bits.  You've seen how they are used to represent stuff, pixels, numbers and characters.  I've mentioned that computers perform operations on the bits, like move them around, add pairs of them together, etc...  One final obvious question is: how are instructions that a computer performs represented?
Well, if you instructed a computer in its native language (machine language), you would have to write instructions in the form of (yes, once again) binary numbers.  This is very, VERY hard to do.  Although the pioneers of computer science did this, no one does this these days.
Just to give you something to look at, just to compare, Table 1.5 shows what the assembler language program in Table 1.1 could look like assuming that the machine instructions are loaded into memory at addresses 100 through 107.  Also, the group of numbers starts at memory address 111 and the size of the group is in memory address 110.

Address	OpCode	Register	Memory Address	Index Register
100	205	1	400000
101	200	2	110
102	361	2	107
103	317	1	111	2
104	254		102
105	200	1	111	2
106	254		102
107	263	17
Address	Value
110	67
111	47316
. . .
177	2751
Table 1.5

A detailed explanation of any computer's instruction set is beyond what can be presented here.  I just wanted you to see how the symbolic information in assembler language programs needs to be converted to numbers (bits) before a computer can perform it. 
If you really want more details now, here is a side lesson from one of my favorite introductory computer science books: The Computer Continuum.