To make compiling stuff on TPT simple I have created a 'Compilation rule Set' When trying to compile something with powder toy. The reason this is useful is to simulate, and build computers, with a set compile feature. I will create a simple Save with this in soon. The inputs would be input by a keyboard with 11 chars on. It will have four inputs(Digits)
The chars are 0 1 2 3 4 5 6 7 8 0 &
This tutorial is not organised!
Clear = 0000 Maths = &=add &&=subtract 9-4 = 9&&4 4+5= 4&5 Output data held in memory = 0001 Save in ram = &&&& (it will save last command) Load from ram = 9999 Display last number = 8888 (Need a LCD)
... its binary code not random numbers 10 doesnt stand for 10 its stands for 62 0 means there are none of this number and 1 means there is 1 of it binarys hard to explain search it up so 0=0 and 1=varys where its placed there are no 2s 3s 4s 5s or anything above 1
Congratulations plead-for-destruction, you just gave the worst explanation of the base 2 counting system in the history of history's history. In binary the value of a place value is either 1 or 0. The easiest way to think of this is on or off. If it is on, you add it to the total number(well this is converting to decimal, but you think in decimal anyway). Secondly, in binary place values increase by twice the previos place value. So the first place value is 1, the second is 1*2=2, the third is 2*2=4, and the fourth is 4*2=8, and so on. So now let me do an example number. 10010, so we in this number we have 1(16), 0(8), 0(4), 1(2), 0(1). Because the 16 and 2 place values are "ON" they are added together, making the decimal value of this number 18. If you have any questions, do ask.
Cr15py Yeah Cr15py don't be an idiot binary starts at 16 but with each consecutive odd number the 0 cancels out the fraction made by the position of the 1 but if the second number is 0 then the binary number is reversed because of the 1 and then the 62 is added instead of the 0 because the 1 is after the 0.