PDA

توجه ! این یک نسخه آرشیو شده میباشد و در این حالت شما عکسی را مشاهده نمیکنید برای مشاهده کامل متن و عکسها بر روی لینک مقابل کلیک کنید : مقاله کامپیوترهای مبنای سه



moji5
8th August 2010, 11:17 AM
تاریخچه

اولین ماشین محاسبه‌ای که با منطق سه‌سه‌ای کار می‌کرد، یک ماشین محاسبه ساخته شده از چوب بود که در سال ۱۸۴۰ (http://fa.wikipedia.org/wiki/%DB%B1%DB%B8%DB%B4%DB%B0_%28%D9%85%DB%8C%D9%84%D8% A7%D8%AF%DB%8C%29) توسط توماس فاولر (http://fa.wikipedia.org/w/index.php?title=%D8%AA%D9%88%D9%85%D8%A7%D8%B3_%D9 %81%D8%A7%D9%88%D9%84%D8%B1_%28%D9%85%D8%AE%D8%AA% D8%B1%D8%B9%29&action=edit&redlink=1) مخترع انگلیسی اختراع شد. نخستین کامپیوتر مدرن الکترونیکی بر مبنای منطق سه‌سه‌ای کامپیوتری به نام سِتون (http://fa.wikipedia.org/w/index.php?title=%D8%B3%D8%AA%D9%88%D9%86_%28%D8%B1 %D8%A7%DB%8C%D8%A7%D9%86%D9%87%29&action=edit&redlink=1) بود که اواخر دهه ۱۹۵۰ (http://fa.wikipedia.org/wiki/%D8%AF%D9%87%D9%87_%DB%B1%DB%B9%DB%B5%DB%B0_%28%D9 %85%DB%8C%D9%84%D8%A7%D8%AF%DB%8C%29) با راهبری پروفسور نیکلای بروسنتسوف (http://fa.wikipedia.org/w/index.php?title=%D9%86%DB%8C%DA%A9%D9%84%D8%A7%DB% 8C_%D8%A8%D8%B1%D9%88%D8%B3%D9%86%D8%AA%D8%B3%D9%8 8%D9%81&action=edit&redlink=1) در دانشگاه دولتی مسکو (http://fa.wikipedia.org/wiki/%D8%AF%D8%A7%D9%86%D8%B4%DA%AF%D8%A7%D9%87_%D8%AF% D9%88%D9%84%D8%AA%DB%8C_%D9%85%D8%B3%DA%A9%D9%88) در اتحاد جماهیر شوروی (http://fa.wikipedia.org/wiki/%D8%A7%D8%AA%D8%AD%D8%A7%D8%AF_%D8%AC%D9%85%D8%A7% D9%87%DB%8C%D8%B1_%D8%B4%D9%88%D8%B1%D9%88%DB%8C) ساخته شد. ستون مزایای قابل توجهی نسبت به کامپیوترهای مبتنی بر منطق دودویی داشت، که از جمله آنها می‌توان به مصرف برق و هزینه تولید کمتر اشاره کرد. در سال ۱۹۷۰ (http://fa.wikipedia.org/wiki/%DB%B1%DB%B9%DB%B7%DB%B0_%28%D9%85%DB%8C%D9%84%D8% A7%D8%AF%DB%8C%29)، بروسنتسوف نمونه پیشرفته‌تری از ستون را ساخت که ستون-۷۰ (http://fa.wikipedia.org/w/index.php?title=%D8%B3%D8%AA%D9%88%D9%86-%DB%B7%DB%B0&action=edit&redlink=1) نام گرفت.[۱] (http://fa.wikipedia.org/wiki/%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1%D 9%87%D8%A7%DB%8C_%D9%85%D8%A8%D9%86%D8%A7%DB%8C_%D 8%B3%D9%87#cite_note-engwiki-0)
مبنای سه متوازن

محاسبه مبنای سه معمولاً بر حسب مبنای سه متوازن انجام می‌شود، که از سه رقم ۱-، ۰ و ۱+ استفاده می‌کند. مقدار منفی هر رقم مبنای سه متوازن می‌تواند با جایگزینی هر + با یک - و بالعکس بدست آید. تفریق یک عدد با معکوس کردن علامت + و - ارقام و سپس استفاده از عمل جمع عادی کاری ساده است. مبنای سه متوازن می‌تواند بدون نیاز به یک علامت منفی در ابتدای عدد، مقادیر منفی را به راحتی مقادیر مثبت بیان کند. این مزایا برخی محاسبات را در مبنای سه کارامدتر از مبنای دو میسازد.
توماس فاولر (http://fa.wikipedia.org/w/index.php?title=%D8%AA%D9%88%D9%85%D8%A7%D8%B3_%D9 %81%D8%A7%D9%88%D9%84%D8%B1_%28%D9%85%D8%AE%D8%AA% D8%B1%D8%B9%29&action=edit&redlink=1) پس از اختراع ماشین محاسبه‌اش در سال ۱۸۴۰ نوشت:
« به نظرم اگر استفاده از محاسبات در مبنای سه از گذشته‌های دور در جامعه بشری رواج پیدا می‌کرد، این روزها می‌توانستیم ماشین‌هایی از این دست را همه جا بیابیم، زیرا انتقال محاسبات ریاضی از ذهن به ماشین در منطق سه‌گانه بسیار ساده انجام می‌پذیرد. » آینده

با ورود و تولید انبوه قطعات کامپیوترهای دودویی و کاهش قیمت آنها، کامپیوترهای مبنای سه در حد یک پاورقی کوچک در تاریخ محاسبات باقی ماندند. اگرچه دانلد کنوت (http://fa.wikipedia.org/wiki/%D8%AF%D8%A7%D9%86%D9%84%D8%AF_%DA%A9%D9%86%D9%88% D8%AA) پیشبینی کرده که ظرافت و کارایی منطق مبنای سه در آینده دوباره موجب توسعه آنها خواهد شد.[۲] (http://fa.wikipedia.org/wiki/%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1%D 9%87%D8%A7%DB%8C_%D9%85%D8%A8%D9%86%D8%A7%DB%8C_%D 8%B3%D9%87#cite_note-1) راه‌های ممکن برای پی بردن به چگونگی وقوع این امر ترکیب یک کامپیوتر نوری با سیستم منطق مبنای سه‌است.[۳] (http://fa.wikipedia.org/wiki/%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1%D 9%87%D8%A7%DB%8C_%D9%85%D8%A8%D9%86%D8%A7%DB%8C_%D 8%B3%D9%87#cite_note-2)
کامپیوترهای مبنای سه در فرهنگ عمومی

در رمان علمی تخیلی زمان کافی برای عشق (http://fa.wikipedia.org/w/index.php?title=%D8%B2%D9%85%D8%A7%D9%86_%DA%A9%D8 %A7%D9%81%DB%8C_%D8%A8%D8%B1%D8%A7%DB%8C_%D8%B9%D8 %B4%D9%82&action=edit&redlink=1)[۴] (http://fa.wikipedia.org/wiki/%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1%D 9%87%D8%A7%DB%8C_%D9%85%D8%A8%D9%86%D8%A7%DB%8C_%D 8%B3%D9%87#cite_note-scifibook-3) نوشته رابرت هاینلاین (http://fa.wikipedia.org/wiki/%D8%B1%D8%A7%D8%A8%D8%B1%D8%AA_%D8%A2%D9%86%D8%B3% D9%88%D9%86_%D9%87%D8%A7%DB%8C%D9%86%E2%80%8C%D9%8 4%D8%A7%DB%8C%D9%86)، سیاره سکوندوس (که بخشی از داستان در آن می‌گذرد) دارای کامپیوترهایی است که بر مبنای منطق سه‌گانه متوازن کار می‌کنند و دارای هوش و ادراک هستند. یکی از این کامپیوترها که مینروا نام دارد، در گزارش نتیجه یک محاسبه می‌گوید: «سیصد و چهل و یک هزار و ششصد و چهل… بازخوانی نتیجه محاسبه بر مبنای منطق سه‌گانه بدین شرح است: یکا جفت جفت ویرگول یکا صفر صفر ویرگول یکا جفت جفت ویرگول یکا صفر صفر ممیز صفر»






Development of ternary computers at Moscow State University

Brousentsov N. P., Maslov S. P., Ramil Alvarez J., Zhogolev E.A.
It is known that the ternary arithmetic has essential advantages as compared with the binary one that is used in present-day computers. In connection with this Donald Knuth assumed that the replacement of "flip-flop" for "flip-flap-flop" one a "good" day will nevertheless happen [1]. Now, when the binary computers predominate, it is hard to believe in a reality of such assumption, but if it would happen not only the computer arithmetic, but the informatics on the whole would become most simple and most perfect. The third value (Aristotle named it snmbebhkoV – attendant) what is very actual but hidden in binary logic, will become obvious and direct manipulated. Ternary logic has better accordance with the Nature and human informal thinking [2]. Unfortunately, the modern researches of the multivalued (non-binary) logic are formal and are not associated with practical requests.
A remarkable exclusion is the experience of creating the ternary computers "Setun" and "Setun 70" at Moscow State University [3,4,5,6]. This experience convincingly confirms practical preferences of ternary digital technique.
The design of small digital machine "Setun" (Setun is the little river which flows into the river "Moscow" near the University) was initiated by member of the academy of Sciences S. L. Sobolev at 1956. It was assumed to create small, inexpensive computer, simple in use and service for schools, research laboratories, design offices and for manufacture control. For such goal at the computer center of the University there was formed a group of young men (4 MS and 5 BA). The joint seminar for engineers and programmers was organized and S. L. Sobolev, K. A. Semendjev, M. R. Shura-Bura, I. S. Berezin were its permanent participants. The problems of optimization of computer architecture and technical realization were examined and the variants of future computer were discussed.
Due to the low reliability of the computer elements on vacuum tubes and inaccessibility of transistors the fast elements on miniature ferrite cores and semiconductor diodes were designed. These elements work as a controlled current transformer and were an effective base for implementation of the threshold logic and its ternary version in particular [7]. Ternary threshold logic elements as compared with the binary ones provide more speed and reliability, require less equipment and power. These were reasons to design a ternary computer.
"Setun" is a sequential computer containing the fast multiplier, thanks to the speed of operation as in parallel devices is achieved. The small (3 pages of 54 words) ferrite RAM that has page exchange with the main magnetic drum memory works as a cash.
"Setun" has an one-address architecture with one index-register. The contents of it, in dependence of value (+,0,-) of address modification trit, may be added to or subtracted from the address part of instruction. The instruction set consists only of 24 instructions including performing mantissa normalization for floating-point calculation, shift, combined multiplication and addition. Three instructions are reserved but have never been used because of the lack of necessity.
Simplicity, economy and elegance of computer architecture are the direct and practically very important consequence of the ternarity, more exactly – of representation of data and instructions by symmetrical (balanced) code, i.e. by code with digits 0, +1, -1. In opposite to binary code there is no difference between "signed" and "unsigned" number. As a result the amount of conditional instructions is decrease twice and it is possible to use them more easily; the arithmetic operations allow free variation of the length of operands and may be executed with different lengths; the ideal rounding is achieved simply by truncation, i.e. the truncation coincides with the rounding and there is the best approximation the rounding number by rounded.
The experience of creating, programming and application of "Setun" unambiguously confirmed the significant preferences of ternarity. In spite of the fact that the designers of the first were very young and the group was small, the specimen of "Setun" was ready in Dec. 1958, i.e. in two years since the beginning. "Setun" worked correctly at once without even debugging and began to execute the existing programs. At 1960 it was sufficient amount of programs and it was possible to present "Setun" for the official testing.
Such testing was passed in Apr. 1960 very successfully. The computer demonstrated unusual for that times reliability and stability of operation in wide range of ambient temperature and supply voltage. It was found that the computer is rather simple both in manufacturing and in service, suitable for wide range of applications. "Setun" was recommended for production.
Unfortunately the officials of the computer production in the USSR had negative position about non-planned and unusual "fruit of university fantasy". Instead of supporting the innovation and taking a possible profit they permanently attempted to annihilate "ugly duckling". There were many orders of "Setun", including ones for export, but only 10-15 computers were produced annually and none of them was exported aboard. The planned manufacture of "Setun" in Czechoslovakia was also broken. At 1965 the manufacturing of "Setun" was stopped in spite of unsatisfied requests. It was replaced by a binary computer of the same performance but more than 2.5 times more expensive.
In total there were produced 50 computers (including the specimens). The 30 ones were installed at universities and colleges, the rest – at research laboratories and plants. Geographically "Setun" were scattered all over the country – from Kaliningrad to Jakutsk and from Ashkhabad to Novosibirsk.
It was found that ternary computer is very favorable for seizing and application. Simplicity of programming in codes (it was decided not to make an assembler) permitted to design a few interpreters mostly in Polish inverse (postfix) notation. On such base it was possible to program the different tasks from engineering calculations and experimental results processing to manufacturing control and computer education.
On the base of "Setun’s" positive experience it was designed and exhaustively determined in Algol-like programming language the architecture of other ternary computer [5]. This computer named "Setun 70" was introduced in 1970 [6]. In "Setun 70" the peculiarities of ternarity are embodied with more understanding and completeness: the ternary format for symbols encoding – "tryte" (analog of binary byte) consisting of 6 trits (~9.5 bits) is established; the instruction set is updated of auxiliary ternary logic and control instructions; arithmetic instructions now allow more variation of operand length – 1, 2 and 3 trytes and length of result may be up to 6 trytes.
The possibility to vary the length of the word-operands is expanded to the word-instructions. More exactly, in "Setun 70" the traditional conception of computer instruction as a word does not exists. The program is a sequence of tryte-operations and tryte-addresses. The executed combinations of such trytes may be interpreted as virtual instructions. But there is no necessity for a programmer to think about this – he (she) constructs postfix expressions directly from the operands and operations by similar way as it is made in mathematics.
"Setun 70" is a two-stack computer. Stack of operands is the evolution of accumulator of one-address "Setun". The return stack is the base of an automata that controls the nesting of subprograms. The simple improvement of such mechanism [8] permits to transform "Setun 70" into some computer for the proposed Dijkstra E.W. structured programming.
An adequate realization of Dijkstra ideas [9] named the "procedure programming", wholly proved his hopes about radical improvement of programming (the goal not achieved in "structured revolution" [10]). Construction and modificatin of the programs on "procedure programming computer" became more easily (in 3-5 times) and the perfect correctness has been achieved.
However "Setun 70" was the last "ternac". After it the research was stopped. In "Setun 70" it was implemented the CAI system "Nastavnik", the binary versions of which are the perfect example of effective realization of computer didactic up to now [11]. The "procedure programming" was transformed into the Dialogue System of Structured Programming (DSSP). DSSP as a matter of fact emulates "Setun 70" architecture on binary computers: thus it fulfills the advantages of "procedure programming" [12]. DSSP exists and evolves, on its base there is originated a high-level "construct programming" [13] that allows in particular to realize the very simple and effective dialogue system of Boolean algebra [14].
Some details of our work is available in [15, 16].
Reference:


Knuth D. E. The art of computer programming. Vol.2. Seminumerical algorithms. // Addison-Wesley, 1969.
Brousentsov N. P. Origins of informatics. // Moscow, The New Millennium Foundation, 1994. (In Russian).
Brousentsov N. P. Computing machine "Setun" of Moscow State University // "New developments on computer technology". – Kiev , 1960, pp. 226-234. (In Russian).
N. P. Brousentsov, S.P.Maslov, V. P. Rosin, A. M. Tishulina. Small digital computing machine "Setun" // Moscow State Univ., 1965. (In Russian).
Brousentsov N. P., Zhogolev E.A. The structure and algorithmic description of small computing machine // "Computers and problems of cybernetics", Issue 8. – Leningrad State Univ., 1971, pp. 34-51. (In Russian).
Brousentsov N. P., Zhogolev E. A., Maslov S. P. General characteristic of small digital machine "Setun 70" // "Computers and problems of cybernetics", Issue 16. – Leningrad State Univ., 1974, pp. 3-20. (In Russian).
Brousentsov N. P. Threshold realization of threevalued logic on electromagnetic elements // "Computers and problems of cybernetics", Issue 9. – Moscow State Univ., 1972, pp.3-35. (In Russian).
Brousentsov N. P., Ramil Alvarez J. The structured programming on small digital machine // "Computers and problems of cybernetics", Issue 15. – Moscow State Univ., 1978, pp. 3-8. (In Russian).
Dijkstra E.W. Notes on structured programming. EWD 249 // Technical University, Eindhoven, Netherlands, 1969.
Yourdon E. The second structured revolution // "Software World", 1981, v.12, n.3.
Brousentsov N. P., Maslov S. P., Ramil Alvarez J. Didactic microcomputer system "Nastavnik". // Moscow, "Nauka", 1990. (In Russian).
N. P. Brousentsov, V. B. Zakharov, I. A. Rudnev, S. A. Sidorov. Dialogue system of structured programming DSSP-80 // "Dialogue microcomputer systems" // Moscow State Univ., 1986, pp. 3-21. (In Russian).
N. P. Brousentsov, S. P. Maslov, J. Ramil Alvarez, S. A. Sidorov Conceptual characteristic of the RIIIS-processor // "Integrated system for teaching, constructing of programs and developing of didactic materials" // Moscow State Univ., 1996, pp. 16-43. (In Russian).
Brusentsov N.P., Vladimirova Yu.S. Solution of Boolean equations // "Computational Mathematics and Modeling", 1998, v.9, n.4, pp. 287-295

لینک ترجمه گوگل

http://translate.google.com/translate?u=http%3A%2F%2Fwww.computer-museum.ru%2Fenglish%2Fsetun.htm&hl=en&langpair=auto|fa&tbb=1&ie=windows-1251

Sinchron Trinary Clock (http://en.trinary.ru/projects/sinchron)

Sinchron Trinary Clock

Trinary's «Sinchron» Ternary Clock

The purpose of the clock is to display the time.
The clock is a device for measuring the time in units less than astronomical day.
We all know that one astronomical day lasts for 24 hours. From midnight to noon the day grows — after noon the day starts going down. This is the main principle of Sinchron Ternary Clock.
From midnight to noon clock count positive: 1, 2, 3 up to 12. After the noon the day goes down and count of hours left till the end of the day begins in the negative way.
For example, value of -3 hours means that there is only 3 hours left till the midnight, in other words it displays 9p.m. (21.00)
Thus, instead of common clock reading from 0 to 24 we have an interval from 0 to 12 and from -11 to 0
Time point on Sinchron Clock is defined by position of curves. For example, concavity in the middle means the beginning of the interval, from peak to concavity values decrease.
Clock use 4 curves to display change of hours, minutes, seconds and milliseconds correspondingly. These curves have different color and amplitude.
For example, in the figures you can see:
Curve of hours http://trinary.ru/images/trinary.clock.sinchron.guide.hour.png

Curve of minutes http://trinary.ru/images/trinary.clock.sinchron.guide.min.png

Curve of seconds http://trinary.ru/images/trinary.clock.sinchron.guide.sec.png

Curve of milliseconds http://trinary.ru/images/trinary.clock.sinchron.guide.msec.png

Example The time on figure: 12 p.m., 15 minutes, 37 seconds, 0 milliseconds.
http://trinary.ru/images/trinary.clock.sinchron.guide.sample.png

We guess you can watch at clocks like these for hours.
But the main thing is that you can see in which interval you are and how much time you have left till the end of the day.
Clocks like this can be used everywhere: in homes and offices; smaller ones (watches) are carried; larger ones are in public places, e.g. a train station.

استفاده از تمامی مطالب سایت تنها با ذکر منبع آن به نام سایت علمی نخبگان جوان و ذکر آدرس سایت مجاز است

استفاده از نام و برند نخبگان جوان به هر نحو توسط سایر سایت ها ممنوع بوده و پیگرد قانونی دارد