Кибернетическая картина мира
.pdfEach of the internal SM’s is connected.with 6 other SM’s, so that all its terminals are engaged. As to peripheral SM’s, they have free terminal groups to which the other RC elements can be switched. If we leave one of the sides measuring 1 x m free and connect microprocessor, memory, and input-output modules to the others, we obtain a RC of the first rank. Qualitative correlations between different elements are defined, depending on the class of tasks which the RC is intended to solve, while the arrangement of elements in the switching field can be chosen arbitrarily. After constructing another switching field in the form of a parallelepiped measuring 1 x m~ x n and connecting the RC of the first rank to it, we obtain a machine of the second rank. This process may continue to infinity. In the general case, architecture of such a RC can be defined recursively.
Any RC consists of the switching field constructed in the form of a rectangular parallelepiped. One of the sides of this field contains the external RC terminals, while the other sides are engaged with other RC’s (their external terminals) or with RC initial elements (microprocessors, memory and input-output modules).
A minimum RC, in terms of number of elements, contains two microprocessors, one input-output module and several memory modules,partofwhichareusedforstoringmicroroutines.Theinternal language of such a RC uses only blocks of a sequential form; i. e., the machine operates in a traditional mode. The first microprocessor operates in an administrative mode, while the second one is in an executive mode. Switching modules are unnecessary in this case, for the external architecture agrees with the internal one. Such a RC is equivalent to a powerful calculator. With storage capacity increased to 25 to 30 modules and a set of operators and standard blocks extended, such a machine is capable of solving complex enough, though not demanding, tasks with high throughput. Further growth of the RC, however, requires the introduction of the switching field into the machine and increasing the number of microprocessors.
Recursive machines offer very effective solution of the reliability problem. By using combined methods of hardware and algorithmic check, one can dependably find any errors occurring in the course of computation. The regular structure of the RC makes it possible to localize the faulty element simply enough. If a SM fails, modules adjacent to it set all links going to the faulty SM to the «engaged» position, and now any routes would be laid to by-pass this module. Similarly, other types of failed elements are switched off (the SM
411
adjacent to the failed element considers this element engaged and does not deal with it any longer). Switching off failed elements involves no changes in programs and does not affect RC operation. True, the limit characteristics of the RC slightly worsen due to switching off, but this worsening would be noticeable only after at least 5% to 10% of all the elements fail. Therefore, large RC’s (exceeding 1 000 elements) practically need no repair over their lifetimes.
7. Conclusion
The five principles of structural and program organization of computers set forth in this paper suggest one common idea, RECURSIVENESS. In fact, these principles, in a more concise form, sound like this: recursive internal language of machine, recursive parallel method of control, recursive memory organization, recursive external architecture of machine, recursive internal architecture. So, it is natural to apply this term to machines where these principles are implemented and call them recursive.
In traditional computers, all tasks are tailored to a tough machine structure, which is a Procrustean bed, in truth. The «feet» of tasks are cut off, and so are the «heads» – due to introducing lots of limitations, thatsometimesemasculatetheessenceoftasks.Theextremecomplexity of modern system software is attributed to the same reasons.
The recursive philosophy of computer organization allows flexible reconstruction of machines in accordance with the structure of tasks. They offer simpler software in many respects, less capacity of working internal memory and lower requirements on the external memory.
Recursive machines consist of a great number of simple elements of smallnomenclatureinterconnectedinaregularway.Thesameelements are used to construct both simple calculators and supersystems. This all favors mass production of RC’s with maximum use of LSI and provides for their economic efficiency.
RC’s provide an effective solution of the reliability problem, removing the need for repair of the machine over its lifetime (till it grows old morally).
The authors hope that a discussion of the recursive machine concept will make it possible to formulate the main problems of computation technology development.
Published in: Proceedings of IFIP Congress. 1974. P. 66. Reprinted with authors’ permission.
V. M. Glushkov, USSR Academy of Sciences Institute of Cybernetics, Ukrainian Academy of Sciences, Kiev, USSR;
412
M. B. Ignatyev, Leningrad Institute of Aviation Instrument Making, Leningrad, USSR;
V. A. Myasnikov, Main Department of Computing Engineering and Control Systems State Committee of the USSR Council of Ministers for Science and Technology, Moscow, USSR;
V. A. Torgashev, Leningrad Institute of Aviation Instrument Making, Leningrad, USSR.
413
Содержание |
|
Предисловие.............................................................................. |
3 |
Введение................................................................................... |
6 |
Глава 1. Научная картина мира и ее эволюция................................ |
11 |
1.1. Мифологическая картина мира.......................................... |
14 |
1.2. Механистическая картина мира......................................... |
16 |
1.3. Неклассическая картина мира........................................... |
18 |
1.4. Принцип обратной связи .................................................. |
20 |
1.5. Самоорганизация и внешнее управление............................. |
21 |
1.6. Трудиться – значит улавливать потоки энергии |
|
(работы С. А. Подолинского).................................................... |
34 |
1.7. Автоматизация и сложность.............................................. |
39 |
1.8. Виртуальные наномиры.................................................... |
47 |
1.9. Пример системы с внешним управлением (текущие угрозы |
|
террористических атак на авиационные системы и их отражение |
|
с помощью внешнего управления)............................................ |
50 |
1.10. Лингвистический поворот............................................... |
61 |
Контрольные вопросы............................................................. |
64 |
Глава 2. Моделирование слабо формализованных систем.................. |
66 |
2.1. Лингво-комбинаторное моделирование и операция |
|
поляризации......................................................................... |
68 |
2.2. Адаптационные возможности сложных систем..................... |
71 |
2.3. Кибернетическая физика.................................................. |
80 |
2.4. Кибернетическая астрономия и астрофизика ....................... |
86 |
2.5. Кибернетическая метеорология.......................................... |
91 |
2.6. Системная кибернетическая биология................................. |
92 |
2.7. Электронный паспорт здоровья на основе компьютерной |
|
модели организма.................................................................. |
97 |
2.8. Экономическая кибернетика.............................................. |
101 |
2.9. Кибернетическая герменевтика.......................................... |
106 |
2.10. Деловая игра «Моделирование города».............................. |
108 |
Контрольные вопросы............................................................. |
109 |
Глава 3. Роботы и искусственный интеллект................................... |
112 |
3.1. Структурирование робототехнических систем...................... |
113 |
3.2. Основные уровни управления поведением робота.................. |
118 |
3.3. Лингвистический подход к анализу уровневой структуры |
|
системы управления роботов.................................................... |
120 |
3.4. Робот как многоцелевая система с избыточностью................ |
125 |
3.5. Основные элементы роботов-манипуляторов........................ |
128 |
3.6. Информационные системы роботов..................................... |
144 |
3.7. Системы обработки информации........................................ |
162 |
3.8. Построение второго уровня управления манипулятором........ |
164 |
3.9. Уровни управления шагающей машиной............................. |
167 |
3.10. Роботы для игры в футбол................................................ |
183 |
414
3.11. Проблемы создания роботизированного автомобиля |
|
для повышения безопасности движения.................................... |
184 |
Контрольные вопросы............................................................. |
201 |
Глава 4. Вычислительные системы и сети....................................... |
202 |
4.1. Эволюция архитектуры вычислительных систем.................. |
203 |
4.2. Рекурсивные вычислительные системы............................... |
216 |
4.3. Технологии защиты информации....................................... |
234 |
4.4. Технологии системы-на-кристале....................................... |
235 |
4.5. Закон Амдала.................................................................. |
236 |
4.6. Мир как модель внутри сверхмашины................................. |
238 |
Контрольные вопросы............................................................. |
241 |
Глава 5. Миры реальные и виртуальные......................................... |
242 |
5.1. Многоагентные обучающие системы – современный подход |
|
к образованию....................................................................... |
243 |
5.2. Открытое образование....................................................... |
252 |
5.3. Дистанционное обучение................................................... |
255 |
5.4. Виртуальные образовательные среды.................................. |
259 |
5.5. Интеллектуальный и программный агенты.......................... |
260 |
5.6. Технологии виртуальных миров в театре............................. |
269 |
5.7. Многовариантная история Петербурга................................ |
278 |
5.8. Репрессированный музей и панорама битвы за Ленинград..... |
284 |
5.9. Моделирование поля боя................................................... |
290 |
Заключение............................................................................... |
298 |
Перечень тем рефератов и дипломных работ................................... |
300 |
Основная литература................................................................... |
303 |
Дополнительная литература......................................................... |
303 |
Приложение 1. Шек-Иовсепянц Р. А., Сабо, Б. В. Уткин Ю. И. |
|
К истории авиационных бортовых вычислительных систем ............. |
308 |
Приложение 2. Меншуткин В. В., Казанский А. Б., Левченко В. Ф. |
|
Экологические и эволюционные модели ....................................... |
374 |
Приложение 3. Glushkov V. M., Ignatyev M. B., Myasnikov V. A., |
|
V. a. torgashev. Recursive machines and computing technology.......... |
398 |
415
Учебное издание
Игнатьев Михаил Борисович
КИБЕРНЕТИЧЕСКАЯ КАРТИНА МИРА Учебное пособие
Редактор А. Г. Ларионова
Верстальщик С. Б. Мацапура
Сдано в набор 4.10.10. Подписано к печати 29.12.10.
Формат 60×84 1/16. Бумага офсетная. Печать офсетная. Усл. печ. л. 26,0. Уч.-изд. л. 26,2. Тираж 200 экз. Заказ № 609.
Редакционно-издательский центр ГУАП 190000, Санкт-Петербург, Б. Морская ул., 67