micke
/
turing_machine
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update README.md

Browse Source
master
Mikael Nordin 7 years ago committed by GitHub
parent cfa6d17771
commit b013c3219b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File

2
README.md
Unescape View File

@ -66,4 +66,4 @@ For instance, the one card busy beaver would look like this:
1:1,1,0,1,0,0 1:1,1,0,1,0,0
```` ````
## The adder program ## The adder program
The adder program on the cards in the repository will add two binary numbers in registry position -1 to -7 and 1 to 7 and place the result in registry position 1 to 8. It does this by decrementing the number in -1 to -7 by one and incrementing the number in 1 to 7 untill the number in the negative part of the registry is zero. The hard code values for the two numbers is 8 and 4 but can be changed to any 7 bit number. The adder program on the cards in the repository will add two binary numbers in registry position -1 to -7 and 1 to 7 and place the result in registry position 1 to 8. It does this by decrementing the number in -1 to -7 by one and incrementing the number in 1 to 7 untill the number in the negative part of the registry is zero. The hard code values for the two numbers is 8 and 3 but can be changed to any 7 bit number.

Write Preview
Loading…
Cancel
Save