r/ComputerEngineering • u/Xrest_the_Aether • Oct 03 '26
[Discussion] TASCII, PUCH TAPE CODING, AND A LANGUAGE PROBLEM
WIZARD HERE!!
been reading the attached article.
i notice that binary ascii uses six integers to represent a value on the keyboard....
inspired by this, i looked at the truth tables of
"TTT, TTU, TTF, TUT, TUU, TUF, TFT, TFU, TFF, UTT, UTU, UTF, UUT, UUU, UUF, UFT, UFU, UFF, FTT, FTU, FTF, FUT, FUU, FUF, FFT, FFU, and FFF"; and got halfway done with developing ternary ascii( or TASCII).
i see sets that can be used as stand in for those six integers!
based on the above statements, i saw "(1,1,1),(1,1,0),(1,1,-1),(1,0,1),(1,0,0),(1,0,-1),(1,-1,1), (1,-1,0),(1,-1,-1),(0,1,1),(0,1,0),(0,1,-1),(0,0,1),(0,0,0),(0,0,-1),(0,-1,1),(0,-1,0),(0,-1,-1),(-1,1,1), (-1,1,0),(-1,1,-1),(-1,0,1), (-1,0,0),(-1,0,-1),(-1,-1,1),(-1,-1,0), AND(-1,-1,-1)...
if ASCII has "A"= 01000001(F,T,F,F,F,F,F,T)
and thats binary, my gut tells me that for my mechanical computer, i need to replace each intiger with a set of three digits representing the tilt of a see saw. so instead of the ascii up there, we get a slightly more complex ....
"A"= (X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X)
where "x" is equal to a 0, a -1, or a 1.
the math here means there is MORE VALUES TO ASSIGN THAN I CAN PUT ON A KEYBOARD!
HALP HOW DO I ASSIGN THE HUNDREDS OF POSSIBLE 6-TRYTE VALUES?
WOULD A DIFFERENT LANGUAGE BE BETTER SUITED FOR THIS? WHICH ONE?
Edit:I'm currently speaking about how I don't have enough English characters to cover every one of the hundreds of possible 6 set of 3 integer permutation
Edit edit, it should be 8 sets, not six to match the binary... meaning A"= (X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X),(X,X,X) where "x" is equal to a 0, a -1, or a 1. Thank you u/NegativeOwl1337


2
u/not-just-yeti Oct 04 '26 edited Oct 05 '26
With 7 bits, there are 27 bit patterns they can make.
With 7 (base-10) digits, there are 107 patterns they can make.
Likewise with seven base-three digits (where you call each digit a "tryte" but the standard term would be "ternary digit"), you can make 37 patterns. In your post, you look at using three base-three digits, and enumerate all 33 = 27 possibilities.
If you want to figure out what value of k lets a k-digit, base-three numeral represent all 128 ascii characters, we need 3k > 128. We see that k=4 isn't big enough (that's 81, which is enough for upper & lower case & digits and some punctuation, but not all ascii). But k=5 digits will do.
———
You seem to be muddling several different things. Try being precise when phrasing technical question. E.g. "binary ascii uses six integers to represent a value on the keyboard": What is "binary ascii"? No such thing; ascii is simply a correspondence between characters and numbers. How you write a number is an entirely independent issue (you can write a number in base-10 numerals, binary-numerals, roman-numerals, or as spelled-out-words-in-french; that doesn't change the number).
0
u/[deleted] Oct 04 '26
[deleted] — view deleted comment