Computer science reconsidered : the innovation model of process expression

Title:

Personal Author:

Fant, Karl M.

Publication Information:

Hoboken, NJ : John Wiley & Sons, 2007

Physical Description:

xix, 269 p. : ill. ; 24 cm.

ISBN:

9780471798149

Subject Term:

Computer science

Parallel processing (Electronic computers)

Electronic data processing -- Distributed processing

Available:*

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010183982	QA76 F36 2007	Open Access Book	Book	Searching... Unknown

The Invocation Model of Process Expression argues that mathematics does not provide the most appropriate conceptual foundations for computer science, but, rather, that these foundations are a primary source of unnecessary complexity and confusion. It supports that there is a more appropriate conceptual model that unifies forms of expression considered quite disparate and simplifies issues considered complex and intractable. This book presents that this model of process expression is alternative theory of computer science that is both valid and practical.

Author Notes

Karl M. Fant is the founder and CEO of Theseus Research, Inc.

Preface	p. xvii
1 A Critical Review of the Notion of the Algorithm in Computer Science	p. 1
1.1 The Notion of the Algorithm in Mathematics	p. 1
1.2 The Advent of Computers	p. 5
1.3 Computer Science	p. 6
1.4 The Algorithm in Computer Science	p. 7
1.5 Conclusion	p. 9
References	p. 9
2 The Simplicity of Concurrency	p. 11
2.1 The Primacy of Sequentiality	p. 12
2.2 The Complexity of Concurrency	p. 12
2.2.1 The Demon of Indeterminacy	p. 12
2.2.2 The State Space Explosion	p. 13
2.2.3 Elusive Confidence	p. 14
2.2.4 Confusions	p. 14
2.3 The Roots of Apparent Complexity	p. 15
2.3.1 The Behavior of Mathematical Functions	p. 15
2.3.2 Re-establishing the Expression of Boundaries	p. 16
2.3.3 Composing Time Intervals	p. 17
2.3.4 The Simplicity of Sequentiality	p. 17
2.4 Symbolic Coordination	p. 17
2.4.1 Symbolically Expressing Data Flow Boundaries	p. 17
2.4.2 Logically Recognizing Data Flow Boundaries	p. 18
2.4.3 The Completeness Behavior of a Network of Enhanced Functions	p. 19
2.4.4 A New Symbolic Primitivity	p. 20
2.4.5 Ignoring NULL	p. 21
2.5 Coordinating Concurrent Networks	p. 21
2.5.1 The Self-coordinating Network	p. 21
2.5.2 Composing Cycles	p. 22
2.6 Partitioning a Concurrent Network	p. 23
2.6.1 Hierarchical Partitioning	p. 23
2.6.2 Lateral Partitioning	p. 24
2.6.3 The Simplicity of Concurrency	p. 25
2.7 The Complexity of Sequentiality	p. 27
2.7.1 Unavoidable Concurrency	p. 27
2.7.2 The Variety of Sequence	p. 27
2.7.3 The Irreversibility of Sequence	p. 28
2.7.4 The Necessary Expression of Memory	p. 28
2.7.5 The Necessary Expression of Control	p. 29
2.7.6 Sequentiality Cannot Be Expressionaly Primitive	p. 29
2.8 Conclusion	p. 30
2.8.1 A Question of Primitivity	p. 30
2.8.2 A Labyrinth of Concepts	p. 31
2.8.3 A Discord of Conceptual Views	p. 32
2.8.4 Illusions of Difficulty	p. 32
2.8.5 A Question of Philosophy	p. 33
References	p. 34
3 Dehumanizing Computer Science	p. 35
3.1 The Humans in Computer Science	p. 35
3.2 Eliminating the Humans	p. 36
3.2.1 The Engineering Human	p. 36
3.2.2 Eliminating the Human Engineer	p. 38
3.2.3 Eliminating the Conceiving Human	p. 40
3.3 Humanless Symbol Systems	p. 41
References	p. 41
4 Transcending the Variable	p. 43
4.1 The Variable in Mathematics	p. 43
4.2 The Variable in Computer Science	p. 44
4.2.1 The Confusion	p. 44
4.2.2 The Discontents	p. 44
4.3 A Competition of Mathematical Formalisms	p. 45
4.4 Process Expression as Association Relationships	p. 46
4.5 Transcending the Variable	p. 50
References	p. 51
5 The Invocation Model	p. 53
5.1 Thengs and Values	p. 53
5.2 Pure Value Expression	p. 54
5.2.1 The Mutual Association of Thengs	p. 54
5.2.2 The Value Transform Rule	p. 55
5.2.3 Value Differentiation	p. 56
5.2.4 Differentness as Limitation of Behavior	p. 57
5.2.5 Differentness as Ongoing Behavior	p. 57
5.2.6 Roman Numerals	p. 58
5.2.7 Expressional Completeness	p. 60
5.2.8 Pure Value Summary	p. 63
5.3 Association Expression	p. 65
5.3.1 The Behavior of Statically Associated Thengs	p. 66
5.3.2 Directionalizing the Resolution Behavior of Association Expressions	p. 66
5.3.3 Discretizing the Resolution Behavior of Association Relationships	p. 70
5.3.4 Summary of Discretization and Directionalization	p. 74
5.3.5 The Pure Association Expression	p. 74
5.3.6 Association Expression Summary	p. 79
5.4 The Spectrum of Expression	p. 80
5.5 The Search	p. 81
5.5.1 Association Search	p. 82
5.5.2 Association Search Failures	p. 82
5.5.3 Value Search	p. 83
5.5.4 The Value Transform Search	p. 83
5.6 Warp and Woof	p. 83
5.7 Summary	p. 84
6 Along the Spectrum	p. 85
6.1 The Example Process	p. 85
6.1.1 Place on the Spectrum	p. 85
6.1.2 Ignoring NULL	p. 86
6.2 Four Available Data Values	p. 86
6.2.1 Name Recognition	p. 86
6.2.2 Appreciation Behavior	p. 89
6.2.3 The Complete Expression	p. 92
6.2.4 Correspondence with Boolean Logic	p. 92
6.3 A Universal Four-Value Operator	p. 93
6.3.1 The Rotate Operator	p. 94
6.3.2 The Equality Operator	p. 95
6.3.3 The Assertion Operator	p. 95
6.3.4 The Priority Operator	p. 95
6.3.5 The Four-Value Expression with the Universal Operator	p. 96
6.4 The Expressivity of Operators	p. 96
6.5 Six Available Data Values	p. 97
6.6 Nine Available Data Values	p. 97
6.7 Fifteen Available Data Values: Pure Value Expression	p. 97
6.8 Three Available Data Values	p. 98
6.9 Two Available Data Values	p. 98
6.10 One Available Data Value	p. 100
6.11 Summary	p. 100
7 Composing Boundaries	p. 103
7.1 Boundaries of Completeness Behavior	p. 103
7.1.1 Association Boundaries	p. 104
7.1.2 Pure Value Boundaries	p. 106
7.1.3 Greater Composition	p. 108
7.1.4 Summary	p. 109
7.2 Coordinating Boundaries	p. 110
7.2.1 The Cycle	p. 110
7.2.2 Flow Coordination	p. 111
7.2.3 Integrated Coordination	p. 111
7.2.4 Level of Coordination	p. 111
7.2.5 Recovering Temporal and Spatial Alignment	p. 116
7.2.6 Generating Skewed Wavefront Flow	p. 117
7.2.7 Composing Coordination	p. 117
7.2.8 Nature's Coordination	p. 118
7.3 Partitioning the Network	p. 118
7.3.1 Completeness Boundaries and Concurrent Behavior	p. 119
7.3.2 Hierarchical Partitioning	p. 120
7.3.3 Lateral Partitioning	p. 122
7.3.4 Mapping the Network	p. 123
7.3.5 Automatic Partitioning and Mapping	p. 124
7.4 Coordinating Pure Value Expressions	p. 124
7.4.1 The Pure Value Cycle	p. 125
7.4.2 Coordinating Cycles	p. 126
7.4.3 Integrating the Expression of Function and Coordination	p. 128
7.4.4 Associating Pure Value Expressions	p. 128
7.4.5 Coordination of Value Flow Among Pure Value Expressions	p. 130
7.4.6 Reusing Values	p. 130
7.5 The Last Association Boundaries	p. 132
7.5.1 Closing the Expression	p. 132
7.5.2 Pure Value Composition	p. 132
7.5.3 The Composition Hierarchy	p. 133
7.6 Summary	p. 134
8 Time and Memory	p. 135
8.1 Association Through Time	p. 136
8.2 Pipeline Memory	p. 136
8.2.1 Graphical Pipeline Representation	p. 136
8.2.2 Differential Pipeline Population	p. 136
8.2.3 The Feedback Ring	p. 137
8.3 Composition of Memories	p. 138
8.3.1 Patterns of Differentness in Time	p. 139
8.3.2 Patterns of Behavior in Time	p. 140
8.3.3 A Behavior Search	p. 140
8.3.4 Composition of Behavior Mappers	p. 142
8.4 Experience Memory	p. 143
8.4.1 Behavior Memory	p. 143
8.4.2 Recognition Memory	p. 144
8.5 A New Form of Expression	p. 144
8.5.1 The Expression of Memory	p. 145
8.5.2 The Expression of Time	p. 146
8.5.3 Whither Referent?	p. 147
8.5.4 The Arrogance of Bulk	p. 147
8.5.5 Whither Stability?	p. 148
8.5.6 A Greater Search	p. 149
8.5.7 The Goal	p. 149
8.6 Time and Memory in Pure Value Expression	p. 150
8.7 Summary	p. 150
9 Incidental Time	p. 151
9.1 Sequentialization of Associations	p. 151
9.2 Time-Space Trade-Off	p. 152
9.2.1 Reusing Operators	p. 152
9.2.2 Sequencing the Feedback Network	p. 155
9.2.3 A Final Merge	p. 157
9.2.4 Referential Expression	p. 157
9.2.5 The Transformed Nature of the Expression	p. 160
9.2.6 Commands in Memory	p. 160
9.2.7 Subexpressions and Iteration	p. 160
9.2.8 Indirect Addressing and Data Structures	p. 160
9.2.9 A Generally Configurable Expression	p. 161
9.2.10 The Conventional Synchronous Sequential Architecture	p. 161
9.2.11 New Notions of Expressivity	p. 161
9.3 Summary	p. 162
10 Points of View	p. 163
10.1 Number as Differentness	p. 163
10.1.1 Interaction of Numeric Differentness	p. 164
10.1.2 Projecting Numeric Differentness	p. 165
10.2 A Landing Eagle	p. 165
10.2.1 The Numeric View	p. 165
10.2.2 The Eagle's View	p. 166
10.3 The Single-Digit Number	p. 168
10.3.1 Single-Digit Number Expressions	p. 169
10.3.2 Two Methods of Approximation	p. 169
10.3.3 Two Views of Expression	p. 170
10.3.4 The Eagle's Answer	p. 171
10.4 Formalism Versus Form	p. 172
10.5 This Primitive-That Primitive	p. 172
10.5.1 The Stateless Primitive	p. 172
10.5.2 The State-Holding Primitive	p. 173
10.5.3 The Consequences	p. 174
10.6 Big Thengs-Little Thengs	p. 175
10.6.1 Nature's Big Thengs	p. 175
10.6.2 Composition Strategies	p. 176
10.7 Observer-Participant	p. 176
10.7.1 Behaving Particles	p. 176
10.7.2 Observed Particles	p. 177
10.7.3 Observer and Participant	p. 177
10.8 Invisible Behaviors and Illusory Behaviors	p. 178
10.8.1 Complementary Chaos	p. 179
10.8.2 Complementary Order	p. 179
10.8.3 Chaotic Flow or Orderly Flow	p. 179
10.8.4 Asymmetric Points of View	p. 180
10.8.5 Finding a Point of View	p. 180
10.9 Slippery Words	p. 180
10.10 Summary	p. 181
11 Referential and Autonomous Process Expression	p. 183
11.1 Autonomous to Referential	p. 183
11.1.1 Primitive Expressivity	p. 183
11.1.2 Loss of Symmetry	p. 184
11.1.3 Meaning	p. 184
11.1.4 Process and Data	p. 184
11.1.5 Intermediate Memory	p. 184
11.1.6 Internal Models of Encountered Expressions	p. 184
11.1.7 Common Symbols	p. 185
11.1.8 Symbolic Processes	p. 185
11.1.9 Transcendent Expression	p. 186
11.2 Referential to Autonomous	p. 186
11.2.1 By Association Expression	p. 186
11.2.2 By Artificial Expression	p. 186
11.3 Economies of Referential Expression	p. 187
11.3.1 Hierarchical Parsimony	p. 188
11.3.2 Partitioning Uniformity	p. 188
11.3.3 Coordination Simplicity	p. 188
11.3.4 Resource Indifference	p. 189
11.4 Archetypal Referential Expression	p. 189
11.4.1 Elusive Essence	p. 189
11.4.2 A Chosen Standard	p. 190
11.4.3 Point of View	p. 192
11.4.4 Summary	p. 192
11.5 Referential of Autonomous	p. 192
11.5.1 The Internal Expression	p. 193
11.5.2 Sampling an Amoeba	p. 193
11.6 Referential to Autonomous	p. 194
11.7 Pure Value Referential Expression	p. 194
11.8 Continual Mapping of Referential to Autonomous	p. 195
11.9 Summary	p. 196
12 The Invocation Language	p. 197
12.1 The Nature of Symbol String Expression	p. 197
12.2 A Language of Association Relationships	p. 198
12.3 The Syntax Structures	p. 199
12.3.1 Lateral Composition: Place-to-Place Association	p. 199
12.3.2 Hierarchical Composition: The Invocation and Definition	p. 200
12.3.3 The Association of Invocation and Definition	p. 202
12.3.4 Abbreviated Forms of the Invocation and Definition	p. 203
12.4 The Comma	p. 206
12.5 Completeness Relations	p. 206
12.5.1 Full Completeness	p. 206
12.5.2 Mutually Exclusive Completeness Relations	p. 206
12.5.3 Conditional Completeness	p. 207
12.5.4 Arbitration Completeness	p. 209
12.5.5 Complex Completeness Relationships	p. 209
12.5.6 The Occasional Output	p. 210
12.6 Bundled Content	p. 211
12.7 Expression Structure	p. 212
12.7.1 Name Correspondence Search	p. 213
12.7.2 Scope of Correspondence Name Reference	p. 213
12.8 A Progression of Examples	p. 214
12.8.1 Imperative Form	p. 214
12.8.2 Functional Form	p. 216
12.8.3 Net List Form	p. 217
12.8.4 Longer Value Transform Rule Names	p. 217
12.8.5 Limited Set of Name-Forming Symbols	p. 218
12.8.6 More Available Content Values	p. 218
12.8.7 Pure Value Expression	p. 220
12.8.8 Another Pure Value Expression	p. 220
12.8.9 Pure Association Expression	p. 221
12.8.10 Another Pure Association Full-Adder	p. 224
12.9 Greater Composition: Four-Bit Adder	p. 225
12.9.1 Associated Invocations	p. 225
12.9.2 Nested Invocations	p. 226
12.9.3 Nested Definitions	p. 226
12.9.4 Structureless Expression	p. 227
12.10 Conditionality	p. 228
12.10.1 If-Then-Else	p. 229
12.10.2 If-Then	p. 229
12.10.3 Multi-way Conditionality	p. 230
12.11 Coordination Boundaries	p. 230
12.11.1 Invocation Boundaries	p. 231
12.11.2 Coordination Behavior	p. 231
12.11.3 Coordinating Boundaries	p. 233
12.12 Large Domains of Differentness	p. 236
12.13 Experience Memory	p. 238
12.14 Conditional Iteration	p. 239
12.15 Value Sequencer	p. 240
12.16 Code Detector	p. 241
12.17 A Control Program	p. 243
12.18 LFSR	p. 245
12.19 Summary	p. 246
13 Reflections	p. 249
13.1 In the Beginning	p. 249
13.2 The Root Problem	p. 250
13.2.1 The Labyrinth	p. 250
13.2.2 Exiting the Labyrinth	p. 251
13.3 Computer Gods	p. 251
13.4 What's in a Name?	p. 252
13.5 The Invocation Model	p. 252
13.6 Composing Differentness	p. 253
13.6.1 The Cycle	p. 253
13.6.2 The Last Composition	p. 254
13.6.3 Nature's Compositions	p. 254
13.7 Time and Memory	p. 254
13.7.1 The Arrogance of Bulk	p. 255
13.7.2 Incidental Time	p. 255
13.8 Points of View	p. 255
13.9 Referential and Autonomous Expression	p. 256
13.10 The Invocation Language	p. 257
13.11 Comparisons	p. 257
13.12 Models of Concurrency	p. 257
13.12.1 Petri Nets	p. 257
13.12.2 Data Flow	p. 258
13.12.3 Asynchronous Circuit Design	p. 259
13.12.4 Actors	p. 260
13.12.5 Connectionism	p. 260
13.13 Conclusion	p. 260
References	p. 261
Index	p. 263

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents