Revision 184635 of User talk:Martinbull

  • Revision slug: User_talk:Martinbull
  • Revision title: User talk:Martinbull
  • Revision id: 184635
  • Created:
  • Creator: Martinbull
  • Is current revision? No
  • Comment

Revision Content

binary is a computer language which is completely made up of 1's and 0's. letters can be formed by putting seven 1 and/or 0 together to form a byte, these bytes are then put together to make words, then punctuation can be added.

Binary | Symbol || Binary | Symbol || Binary | Symbol

0100000 | Space || 1000000 | @ || 1100000 | `

0100001 | ! || 1000001 | A || 1100001 | a

0100010 | “ || 1000010 | B || 1100010 | b

0100011 | # || 1000011 | C || 1100011 | c

0100100 | $ || 1000100 | D || 1100100 | d

0100101 | % || 1000101 | E || 1100101 | e

0100110 | & || 1000110 | F || 1100110 | f

0100111 | ‘ || 1000111 | G || 1100111 | g

0101000 | ( || 1001000 | H || 1101000 | h

0101001 | ) || 1001001 | I || 1101001 | i

0101010 | * || 1001010 | J || 1101010 | j

0101011 | + || 1001011 | K || 1101011 | k

0101100 | , || 1001100 | L || 1101100 | l

0101101 | - || 1001101 | M || 1101101 | m

0101110 | . || 1001110 | N || 1101110 | n

0101111 | / || 1001111 | O || 1101111 | o

0110000 | 0 || 1010000 | P || 1110000 | p

0110001 | 1 || 1010001 | Q || 1110001 | q

0110010 | 2 || 1010010 | R || 1110010 | r

0110011 | 3 || 1010011 | S || 1110011 | s

0110100 | 4 || 1010100 | T || 1110100 | t

0110101 | 5 || 1010101 | U || 1110101 | u

0110110 | 6 || 1010110 | V || 1110110 | v

0110111 | 7 || 1010111 | W || 1110111 | w

0111000 | 8 || 1011000 | X || 1111000 | x

0111001 | 9 || 1011001 | Y || 1111001 | y

0111010 | : || 1011010 | Z || 1111010 | z

0111011 | ; || 1011011 | [ || 1111011 | {

0111100 | < || 1011100 | \ || 1111100 | |

0111101 | = || 1011101 | ] || 1111101 | }

0111110 | > || 1011110 | ^ || 1111110 | ~

01111111| ? || 1011111 | _ ||

binary can be very easy when you learn it.

for example my name is Martin, so my name would be: 100110111000011110010111010011010011101110

Revision Source

<p>binary is a computer language which is completely made up of 1's and 0's. letters can be formed by putting seven 1 and/or 0 together to form a byte, these bytes are then put together to make words, then punctuation can be added.
</p><p>Binary	|	Symbol	||	Binary	|	Symbol	||	Binary	|	Symbol
</p><p>0100000	|	Space	||	1000000	|	@	||	1100000	|	`
</p><p>0100001	|	!	||	1000001	|	A	||	1100001	|	a
</p><p>0100010	|	“	||	1000010	|	B	||	1100010	|	b
</p><p>0100011	|	#	||	1000011	|	C	||	1100011	|	c
</p><p>0100100	|	$	||	1000100	|	D	||	1100100	|	d
</p><p>0100101	|	%	||	1000101	|	E	||	1100101	|	e
</p><p>0100110	|	&amp;	||	1000110	|	F	||	1100110	|	f
</p><p>0100111	|	‘	||	1000111	|	G	||	1100111	|	g
</p><p>0101000	|	(	||	1001000	|	H	||	1101000	|	h
</p><p>0101001	|	)	||	1001001	|	I	||	1101001	|	i
</p><p>0101010	|	*	||	1001010	|	J	||	1101010	|	j
</p><p>0101011	|	+	||	1001011	|	K	||	1101011	|	k
</p><p>0101100	|	,	||	1001100	|	L	||	1101100	|	l
</p><p>0101101	|	-	||	1001101	|	M	||	1101101	|	m
</p><p>0101110	|	.	||	1001110	|	N	||	1101110	|	n
</p><p>0101111	|	/	||	1001111	|	O	||	1101111	|	o
</p><p>0110000	|	0	||	1010000	|	P	||	1110000	|	p
</p><p>0110001	|	1	||	1010001	|	Q	||	1110001	|	q
</p><p>0110010	|	2	||	1010010	|	R	||	1110010	|	r
</p><p>0110011	|	3	||	1010011	|	S	||	1110011	|	s
</p><p>0110100	|	4	||	1010100	|	T	||	1110100	|	t
</p><p>0110101	|	5	||	1010101	|	U	||	1110101	|	u
</p><p>0110110	|	6	||	1010110	|	V	||	1110110	|	v
</p><p>0110111	|	7	||	1010111	|	W	||	1110111	|	w
</p><p>0111000	|	8	||	1011000	|	X	||	1111000	|	x
</p><p>0111001	|	9	||	1011001	|	Y	||	1111001	|	y
</p><p>0111010	|	:	||	1011010	|	Z	||	1111010	|	z
</p><p>0111011	|	;	||	1011011	|	[	||	1111011	|	{
</p><p>0111100	|	&lt;	||	1011100	|	\	||	1111100	|	|
</p><p>0111101	|	=	||	1011101	|	]	||	1111101	|	}
</p><p>0111110	|	&gt;	||	1011110	|	^	||	1111110	|	~
</p><p>01111111|	?	||	1011111	|	_	||	
</p><p>binary can be very easy when you learn it.
</p><p>for example my name is Martin, so my name would be: 100110111000011110010111010011010011101110
</p>
Revert to this revision