Neumann J.V. — Theory of Self-Reproducing Automata :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Neumann J.V. — Theory of Self-Reproducing Automata

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Theory of Self-Reproducing Automata

Автор: Neumann J.V.

Язык:

Рубрика: Технология/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1st edition

Год издания: 1966

Количество страниц: 388

Добавлена в каталог: 15.11.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Nervous system, complexity of      37
Nervous system, languages of      15
Nervous system, probabilistic logics and      15
Neuron fatigue      48—49
Neuron response      100
Neuron stimulus      100
Neurons      77 99—101
Neurons, excited      44
Neurons, quiescent      44
Non-Euclidean spaces      103
Non-linear partial differential equations      2 19 33—34 97
Non-linear partial differential equations of self-reproduction      97 106
Nyquist, H.      61
Optimally and minimality      91—92
Ordinary stimulus      110—111
Ordinary transmission states $T_{0\alpha\epsilon}$       107 134—136
Ordinary transmission states $T_{0\alpha\epsilon}$ as connecting lines      135—130
Ordinary transmission states $T_{0\alpha\epsilon}$ , logical-neural functions and      134
Output direction      135
Parallel processing      7 22 23 157—158 261
Parametron      16
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$       162—170 238 292
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , alternate periodic pulser $\mathbf{PP}(\overline{\overline{1}})$       174
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , characteristic of      163
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , construction of      163—175
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , corruption of by interference      169—170
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , dimensions of      168—164 170—171
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , external characteristics summarized      174—175
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , operation illustrated      162—163
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , order of      168
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , phasing for      173—174
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , rules for avoiding corruption (final version)      172
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , rules for avoiding corruption (initial version)      169—170
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , special periodic palser $\mathbf{PP}(\overline{\overline{1}})$ , shown defective and altered      174
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , special periodic pulser $\mathbf{PP}(\overline{\overline{1}})$       163 167 227
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , start mechanism of      164
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , stop mechanism of      165—166
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , timing considerations corrected      172—173
Periodic pulser $\mathbf{PP}(\overline{\overline{i^{1}...i^{n}}})$ , timing considerations for      168—169 170—171
Periodic repetition      158
Pitts, W.      9 43 77 100 101
Prepositional functions      100—101
Primary (constructing) automaton      82 111 116 271 288 289
Probabilistic logics      20 26 58—63 99
Probability theory      99
Programmer’s language      14—15
Programming      12—15
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$       150—162 292
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , behavior described      159
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , characteristic of      159
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , construction of      159—161
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , dimensions of      159—161
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , external characteristics summarised      162
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , order of      159
Pulser $\mathbf{P}(\overline{i^{1}...i^{n}})$ , timing for      160—161
Quadratic lattice      132
quantum mechanics      59 62
Quiescence, total      104
Quiescent states      99 103 106—107
Rajchman, J.A.      12
Read-write mechanisms      114—116
Read-write-erase control unit $\mathbf{RWEC}$       226 227 246—250 251 259 293
Read-write-erase control unit $\mathbf{RWEC}$ , control organs $\mathbf{CO}$ of      229—230
Read-write-erase control unit $\mathbf{RWEC}$ , dimensions of      242—243
Read-write-erase control unit $\mathbf{RWEC}$ , function of      246—247
Read-write-erase unit $\mathbf{RWE}$       226—227 230—281 237—243 261 269 293
Read-write-erase unit $\mathbf{RWE}$ , construction of      287—243
Read-write-erase unit $\mathbf{RWE}$ , dimensions of      241
Recognizer $\mathbf{R}(\overline{i^{1}i^{2}...i^{n}})$ )      189—190
Recognizing device      175 (see also “Recognizer”)
recursive functions      26
Redundancy      60
Refractoriness      90 (see also “Fatigue”)
Refractory period      48 96
Regularity      105
Reliability      22 23 24—25 67 70—73
Reliable systems and unreliable components      19 70—71
Responding organ $\Omega$       181 215
Reverse process      107 111 140—342 272
Reverse process, need for      143
Richard paradox      123—124
Richard paradox and self-reproduction      122—123
Richard, J.      123
Rigid binary tape      83
Rigid member      8i
Rigid timing      157
Russell, B.      125
Scientific method      3
Secondary (constructed) automaton      111 271 288
Secondary (constructed) automaton, algorithm for constructing and starting      276
Secondary (constructed) automaton, algorithm for constructing and starting revised      283—285
Secondary (constructed) automaton, complete description of initial conditions for      117
Secondary (constructed) automaton, construction of      272 280—285 290—291
Secondary (constructed) automaton, dimensions of      116—117
Secondary (constructed) automaton, initial state of      117 127—128
Secondary (constructed) automaton, parametric form plan of      112—113
Secondary (constructed) automaton, plan of      111—112
Secondary (constructed) automaton, positioning of      120—127 129
Secondary (constructed) automaton, starting stimulus for      12S
Secondary (constructed) automaton, universal type of plan of      116—118
Self-reference and self-reproduction      125—126
Self-reproducing cellular automaton      294—296
Self-reproduction      19—21 78—86 92 95 106 289—291 292
Self-reproduction in a cellular structure      291—296
Self-reproduction, a priori argument against      79 118 121
Self-reproduction, cellular model of      93—95
Self-reproduction, circumvention of a priori argument against      118—119
Self-reproduction, conflicts and collisions of progeny      130
Self-reproduction, continuous model of      93 95 97—99 105—106 2S8
Self-reproduction, differential equations of      97 106
Self-reproduction, excitation-threshold-fatigue model of      93 95 96
Self-reproduction, kinematic model of      80—87 93—94 287—288
Self-reproduction, physiological aspects of for automats      129—131
Self-reproduction, probabilistic model of      93
Self-reproduction, sequential      128—129
Self-reproduction, single-action      128—129
sequencing      111—112

Serial processing      22 23
Shannon, C.E.      27 59—61
Sharpless, T.K.      6
Simulation      14—15
SIZE      64—65
Special stimuli      110—111 288
Special stimuli, origination of      141—142
Special transmission states $T_{1\alpha\epsilon}$       107
Speed      65—66
Split      139
SSEC      66
State organ $\mathbf{SO}$       267—269
State transition rule, derived for confluent states      136—138
State transition rule, derived for ordinary transmission states      136—138
State transition rule, derived for sensitized states      144—146
State transition rule, derived for special transmission states      140
State transition rule, illustrated      151—156
State transition rule, modifications required by reverse process      140—141
State transition rule, modified for confluent states      147—148
State transition rule, rigorous description of      148—150
State transition rule, verbal summary      150—161
States      see “Confluent states” “Ordinary “Special “Unexcitabic
States of cell alar automaton, verbal summary      150—151
States, active      103
States, duality of ordinary and special      143—143
States, excitable      107 109 288
States, excited      99
States, INITIAL      108 264
States, sensitized      107 145
Static-dynamic converter      281—283
Stationarity      103
Step in phase k in period s      158
Step m period s      158
Stimalus organ      81
Stimuli producer      81
Stop at step l      158
storage devices      7 10 41
Storage devices, acoustic delay line      8 67—53
Storage devices, cathode ray tube      68
Storage devices, electrostatic      11—12
Storage devices, film      75
Storage devices, magnetic tape      75
Storage devices, punched cards      75
Storage devices, punched tape      74
Storage devices, vacuum tubes      7—8 67
Strict logics      59
Structure      104—106
Subharmonic generator      16—17
Survival      72 73
Synthesis      75—86
Szilard, L.      59 50 61
Tape and tape control components      201
Tape, indefinitely extendible      92 202—203 289
Tape-copying operation      295
Tarski, A.      55
Taub, A.      1
Temporal reference frame      108
Tessellation model      see “Cellular structure”
Thatoher, J.      279 280 290 291
Theory of games      21
Thermodynamic-based logics      62—63
Thermodynamics      19 26 28 59—63 66 91
Threshold      97—98
Threshold neurons      96
Threshold switches      9
Timing loop $C_{2}$       115 180 213—214 228 238 246 293
Timing loop $C_{2}$ , function of      213 215
Timing loop $C_{2}$ , lengthening of      216—218
Timing loop $C_{2}$ , shortening of      221—222
Timing loop $C_{2}$ , timing considerations for      213—214
Tissues      77
Total numerical material produced in a process      39
Transfer area $\mathbf{Y}$       227 252—253 293
Transition rule      132 134
Transmission states $T_{u\alpha\epsilon}$       135 (see also “Ordinary transmission states” “Special
Triple-return counter $\Phi$       170—187 215 227 238 292
Triple-return counter $\Phi$ , behavior described      180
Triple-return counter $\Phi$ , coding and decoding considerations for      184—185
Triple-return counter $\Phi$ , construction of      181—185
Triple-return counter $\Phi$ , corruption considerations for      186
Triple-return counter $\Phi$ , dimensions of      179 185—186
Triple-return counter $\Phi$ , function of      180
Triple-return counter $\Phi$ , function of in $\mathbf{MC}$       234
Triple-return counter $\Phi$ , primary and secondary input-output pairs in      131
Triple-return counter $\Phi$ , timing considerations for      181 185—187
Turing machine      25 45 49—53 54 74—75 107 114—115 289 293
Turing machine, abstract      52
Turing machine, automatic programming and      14—15
Turing machine, circle-free      62 124
Turing machine, circular      52 124
Turing machine, concrete      51—52 124
Turing, A.      14 25 43 49 52 83 92 99 122 204
Type theory      51 63—65 125
Ulam, S.M.      1 2 3 5 6 28 94 95 102
Unexcitable state $\mathbf{U}$       107 109 139—140 288
Universal computing machine $M_{u}$       270—271 285—286 294
Universal construction, affected by interference problem for $\mathbf{MC}$       260—261
Universal constructor $M_{\sigma}=\mathbf{CU}+(\mathbf{MC}+\mathbf{L})$       271—286 289—291 294 “Constructing
Universal constructor $M_{\sigma}=\mathbf{CU}+(\mathbf{MC}+\mathbf{L})$ , general construction procedure      272
Universal constructor $M_{\sigma}=\mathbf{CU}+(\mathbf{MC}+\mathbf{L})$ , modified to $M_{c}*$       295
Universal Turing machine      50—51 52 56 83 288
Universal Turing machine, designed in cellular structure      266—270
Universal Turing machine, operation of in cellular space      268—269
Vanuxem Lectures      95—96
Visual pattern      46—47 53—54
Volume      66
von Neumann, Mrs. K.      1 94
von Neumann’s five main questions      92 292
Wang, H.      291
Wiener, N.      22 27 00 01
Wigington, R.L.      16
Wilkes, M.V.      9
Williams, F.C.      12
Wire-crossing      180 183 190 191—192 261—264
Wright, J.      43
“Copying”, use of descriptions vs. originals in self-reproduction      84 121—122
“Garden-of-Eden” configuration      291
“Structure of the vacuum”      102—106 109

1 2

О проекте