![]() music |
![]() | OSdata.com |
ternary programming and operations
summary
This optional chapter looks at ternary (three-state) programming, logic, and operations.
free computer programming text book projecttable of contents
|
![]() music |
![]() | OSdata.com |
This optional chapter looks at ternary (three-state) programming, logic, and operations.
free computer programming text book projecttable of contents
|
This optional chapter looks at ternary (three-state) programming, logic, and operations.
Base three has been proposed for computers on the argument that three state logic is almost as easy to build as two state logic and that the storage of numbers (and therefore, countable items) in base three is more efficient than binary base two.
The ternary number system uses the digits 0, 1, and 2. The balanced ternary system uses the digits -1, 0, and +1.
A single digit in either ternary number system is called a trit. A ternary tryte of either six trits (as ion the Setun computer) or nine trits (theoritcal) is the computer equivalent of a binary byte.
A ternary string is a string that contains only 0s, 1s, and 2s.
Every integer can be expressed as a balanced ternary expansion of the form:
ek3k + ek-13k-1 + + e13 + e0
The experimental Russian Setun computer, built at Moscow State University in 1958, used balanced ternary notation. Fifty Setun computers (named for the Setun River, which ends near moscow) were built between 1958 and 1965. The Forth-like programming language DSSP (Dialog System for Structured Programming) was created by computer science students at Moscow State university for the Setun computer.
perhaps the symmetric properties and simple arithmetic of this number system will prove to be quite important some daywhen the flip-flop is replaced by the flip-flap-flop.Fundamental Algorithms; The Art of Computer Programming; Vol. 1; by Donald Knuth
There is a temporary stoppage in work on this project because the author is once again homeless. This is a very worthy project that can benefit tens of millions of poor students at a very low cost (hundreds of dollars a month) and a banner ad for the sponsor could lead to millions of dollars of income. If a business is interested in supporting this project, please see project for details.
return to table of contents
free downloadable college text book
Because I no longer have the computer and software to make PDFs, the book is available as an HTML file, which you can convert into a PDF.
| previous page | next page |
free computer programming text book projectBuilding a free downloadable text book on computer programming for university, college, community college, and high school classes in computer programming. If you like the idea of this project, At the time I write this message I am a few days from becoming homeless. That will greatly interfere with my ability to create this project, which can help nearly 20 million U.S. college students and more than 150 million students world-wide. I am looking for 30 rich people or corporations willing to donate $10 a month to my church so that the church can provide a place indoors for me to continue work. If you want to donate, please see help project. Thanks much. Supporting the entire project: If you have a business or organization that can support the entire cost of this project, please contact Pr Ntr Kmt (my church) free downloadable college text book on computer programming. |
I do the news as an unpaid volunteer for KOCI 101.5 FM, Newport Beach/Costa Mesa (also available on the web)

This web site handcrafted on Macintosh
computers using Tom Benders Tex-Edit Plus
and served using FreeBSD
.
UNIX used as a generic term unless specifically used as a trademark (such as in the phrase UNIX certified). UNIX is a registered trademark in the United States and other countries, licensed exclusively through X/Open Company Ltd.
Names and logos of various OSs are trademarks of their respective owners.
Copyright © 2011 Milo
Created: March 3, 2011
Last Updated: March 3, 2011
return to table of contents
free downloadable college text book
| previous page | next page |