Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer science reconsidered [[electronic resource] ] : the invocation model of process expression / / Karl M. Fant
| Computer science reconsidered [[electronic resource] ] : the invocation model of process expression / / Karl M. Fant |
| Autore | Fant Karl M |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (291 p.) |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Parallel processing (Electronic computers) Electronic data processing - Distributed processing |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-91684-2
9786610916849 0-470-12577-2 0-470-12576-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
COMPUTER SCIENCE RECONSIDERED; CONTENTS; Preface; 1 A Critical Review of the Notion of the Algorithm in Computer Science; 1.1 The Notion of the Algorithm in Mathematics; 1.2 The Advent of Computers; 1.3 Computer Science; 1.4 The Algorithm in Computer Science; 1.5 Conclusion; References; 2 The Simplicity of Concurrency; 2.1 The Primacy of Sequentiality; 2.2 The Complexity of Concurrency; 2.2.1 The Demon of Indeterminacy; 2.2.2 The State Space Explosion; 2.2.3 Elusive Confidence; 2.2.4 Confusions; 2.3 The Roots of Apparent Complexity; 2.3.1 The Behavior of Mathematical Functions
2.3.2 Re-establishing the Expression of Boundaries2.3.3 Composing Time Intervals; 2.3.4 The Simplicity of Sequentiality; 2.4 Symbolic Coordination; 2.4.1 Symbolically Expressing Data Flow Boundaries; 2.4.2 Logically Recognizing Data Flow Boundaries; 2.4.3 The Completeness Behavior of a Network of Enhanced Functions; 2.4.4 A New Symbolic Primitivity; 2.4.5 Ignoring NULL; 2.5 Coordinating Concurrent Networks; 2.5.1 The Self-coordinating Network; 2.5.2 Composing Cycles; 2.6 Partitioning a Concurrent Network; 2.6.1 Hierarchical Partitioning; 2.6.2 Lateral Partitioning 2.6.3 The Simplicity of Concurrency2.7 The Complexity of Sequentiality; 2.7.1 Unavoidable Concurrency; 2.7.2 The Variety of Sequence; 2.7.3 The Irreversibility of Sequence; 2.7.4 The Necessary Expression of Memory; 2.7.5 The Necessary Expression of Control; 2.7.6 Sequentiality Cannot Be Expressionaly Primitive; 2.8 Conclusion; 2.8.1 A Question of Primitivity; 2.8.2 A Labyrinth of Concepts; 2.8.3 A Discord of Conceptual Views; 2.8.4 Illusions of Difficulty; 2.8.5 A Question of Philosophy; References; 3 Dehumanizing Computer Science; 3.1 The Humans in Computer Science 3.2 Eliminating the Humans3.2.1 The Engineering Human; 3.2.2 Eliminating the Human Engineer; 3.2.3 Eliminating the Conceiving Human; 3.3 Humanless Symbol Systems; References; 4 Transcending the Variable; 4.1 The Variable in Mathematics; 4.2 The Variable in Computer Science; 4.2.1 The Confusion; 4.2.2 The Discontents; 4.3 A Competition of Mathematical Formalisms; 4.4 Process Expression as Association Relationships; 4.5 Transcending the Variable; References; 5 The Invocation Model; 5.1 Thengs and Values; 5.2 Pure Value Expression; 5.2.1 The Mutual Association of Thengs 5.2.2 The Value Transform Rule5.2.3 Value Differentiation; 5.2.4 Differentness as Limitation of Behavior; 5.2.5 Differentness as Ongoing Behavior; 5.2.6 Roman Numerals; 5.2.7 Expressional Completeness; 5.2.8 Pure Value Summary; 5.3 Association Expression; 5.3.1 The Behavior of Statically Associated Thengs; 5.3.2 Directionalizing the Resolution Behavior of Association Expressions; 5.3.3 Discretizing the Resolution Behavior of Association Relationships; 5.3.4 Summary of Discretization and Directionalization; 5.3.5 The Pure Association Expression; 5.3.6 Association Expression Summary 5.4 The Spectrum of Expression |
| Record Nr. | UNINA-9910143429303321 |
Fant Karl M
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer science reconsidered [[electronic resource] ] : the invocation model of process expression / / Karl M. Fant
| Computer science reconsidered [[electronic resource] ] : the invocation model of process expression / / Karl M. Fant |
| Autore | Fant Karl M |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (291 p.) |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Parallel processing (Electronic computers) Electronic data processing - Distributed processing |
| ISBN |
1-280-91684-2
9786610916849 0-470-12577-2 0-470-12576-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
COMPUTER SCIENCE RECONSIDERED; CONTENTS; Preface; 1 A Critical Review of the Notion of the Algorithm in Computer Science; 1.1 The Notion of the Algorithm in Mathematics; 1.2 The Advent of Computers; 1.3 Computer Science; 1.4 The Algorithm in Computer Science; 1.5 Conclusion; References; 2 The Simplicity of Concurrency; 2.1 The Primacy of Sequentiality; 2.2 The Complexity of Concurrency; 2.2.1 The Demon of Indeterminacy; 2.2.2 The State Space Explosion; 2.2.3 Elusive Confidence; 2.2.4 Confusions; 2.3 The Roots of Apparent Complexity; 2.3.1 The Behavior of Mathematical Functions
2.3.2 Re-establishing the Expression of Boundaries2.3.3 Composing Time Intervals; 2.3.4 The Simplicity of Sequentiality; 2.4 Symbolic Coordination; 2.4.1 Symbolically Expressing Data Flow Boundaries; 2.4.2 Logically Recognizing Data Flow Boundaries; 2.4.3 The Completeness Behavior of a Network of Enhanced Functions; 2.4.4 A New Symbolic Primitivity; 2.4.5 Ignoring NULL; 2.5 Coordinating Concurrent Networks; 2.5.1 The Self-coordinating Network; 2.5.2 Composing Cycles; 2.6 Partitioning a Concurrent Network; 2.6.1 Hierarchical Partitioning; 2.6.2 Lateral Partitioning 2.6.3 The Simplicity of Concurrency2.7 The Complexity of Sequentiality; 2.7.1 Unavoidable Concurrency; 2.7.2 The Variety of Sequence; 2.7.3 The Irreversibility of Sequence; 2.7.4 The Necessary Expression of Memory; 2.7.5 The Necessary Expression of Control; 2.7.6 Sequentiality Cannot Be Expressionaly Primitive; 2.8 Conclusion; 2.8.1 A Question of Primitivity; 2.8.2 A Labyrinth of Concepts; 2.8.3 A Discord of Conceptual Views; 2.8.4 Illusions of Difficulty; 2.8.5 A Question of Philosophy; References; 3 Dehumanizing Computer Science; 3.1 The Humans in Computer Science 3.2 Eliminating the Humans3.2.1 The Engineering Human; 3.2.2 Eliminating the Human Engineer; 3.2.3 Eliminating the Conceiving Human; 3.3 Humanless Symbol Systems; References; 4 Transcending the Variable; 4.1 The Variable in Mathematics; 4.2 The Variable in Computer Science; 4.2.1 The Confusion; 4.2.2 The Discontents; 4.3 A Competition of Mathematical Formalisms; 4.4 Process Expression as Association Relationships; 4.5 Transcending the Variable; References; 5 The Invocation Model; 5.1 Thengs and Values; 5.2 Pure Value Expression; 5.2.1 The Mutual Association of Thengs 5.2.2 The Value Transform Rule5.2.3 Value Differentiation; 5.2.4 Differentness as Limitation of Behavior; 5.2.5 Differentness as Ongoing Behavior; 5.2.6 Roman Numerals; 5.2.7 Expressional Completeness; 5.2.8 Pure Value Summary; 5.3 Association Expression; 5.3.1 The Behavior of Statically Associated Thengs; 5.3.2 Directionalizing the Resolution Behavior of Association Expressions; 5.3.3 Discretizing the Resolution Behavior of Association Relationships; 5.3.4 Summary of Discretization and Directionalization; 5.3.5 The Pure Association Expression; 5.3.6 Association Expression Summary 5.4 The Spectrum of Expression |
| Record Nr. | UNINA-9910830854503321 |
|
Fant Karl M
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer science reconsidered : the invocation model of process expression / / Karl M. Fant
| Computer science reconsidered : the invocation model of process expression / / Karl M. Fant |
| Autore | Fant Karl M |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (291 p.) |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Parallel processing (Electronic computers) Electronic data processing - Distributed processing |
| ISBN |
1-280-91684-2
9786610916849 0-470-12577-2 0-470-12576-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
COMPUTER SCIENCE RECONSIDERED; CONTENTS; Preface; 1 A Critical Review of the Notion of the Algorithm in Computer Science; 1.1 The Notion of the Algorithm in Mathematics; 1.2 The Advent of Computers; 1.3 Computer Science; 1.4 The Algorithm in Computer Science; 1.5 Conclusion; References; 2 The Simplicity of Concurrency; 2.1 The Primacy of Sequentiality; 2.2 The Complexity of Concurrency; 2.2.1 The Demon of Indeterminacy; 2.2.2 The State Space Explosion; 2.2.3 Elusive Confidence; 2.2.4 Confusions; 2.3 The Roots of Apparent Complexity; 2.3.1 The Behavior of Mathematical Functions
2.3.2 Re-establishing the Expression of Boundaries2.3.3 Composing Time Intervals; 2.3.4 The Simplicity of Sequentiality; 2.4 Symbolic Coordination; 2.4.1 Symbolically Expressing Data Flow Boundaries; 2.4.2 Logically Recognizing Data Flow Boundaries; 2.4.3 The Completeness Behavior of a Network of Enhanced Functions; 2.4.4 A New Symbolic Primitivity; 2.4.5 Ignoring NULL; 2.5 Coordinating Concurrent Networks; 2.5.1 The Self-coordinating Network; 2.5.2 Composing Cycles; 2.6 Partitioning a Concurrent Network; 2.6.1 Hierarchical Partitioning; 2.6.2 Lateral Partitioning 2.6.3 The Simplicity of Concurrency2.7 The Complexity of Sequentiality; 2.7.1 Unavoidable Concurrency; 2.7.2 The Variety of Sequence; 2.7.3 The Irreversibility of Sequence; 2.7.4 The Necessary Expression of Memory; 2.7.5 The Necessary Expression of Control; 2.7.6 Sequentiality Cannot Be Expressionaly Primitive; 2.8 Conclusion; 2.8.1 A Question of Primitivity; 2.8.2 A Labyrinth of Concepts; 2.8.3 A Discord of Conceptual Views; 2.8.4 Illusions of Difficulty; 2.8.5 A Question of Philosophy; References; 3 Dehumanizing Computer Science; 3.1 The Humans in Computer Science 3.2 Eliminating the Humans3.2.1 The Engineering Human; 3.2.2 Eliminating the Human Engineer; 3.2.3 Eliminating the Conceiving Human; 3.3 Humanless Symbol Systems; References; 4 Transcending the Variable; 4.1 The Variable in Mathematics; 4.2 The Variable in Computer Science; 4.2.1 The Confusion; 4.2.2 The Discontents; 4.3 A Competition of Mathematical Formalisms; 4.4 Process Expression as Association Relationships; 4.5 Transcending the Variable; References; 5 The Invocation Model; 5.1 Thengs and Values; 5.2 Pure Value Expression; 5.2.1 The Mutual Association of Thengs 5.2.2 The Value Transform Rule5.2.3 Value Differentiation; 5.2.4 Differentness as Limitation of Behavior; 5.2.5 Differentness as Ongoing Behavior; 5.2.6 Roman Numerals; 5.2.7 Expressional Completeness; 5.2.8 Pure Value Summary; 5.3 Association Expression; 5.3.1 The Behavior of Statically Associated Thengs; 5.3.2 Directionalizing the Resolution Behavior of Association Expressions; 5.3.3 Discretizing the Resolution Behavior of Association Relationships; 5.3.4 Summary of Discretization and Directionalization; 5.3.5 The Pure Association Expression; 5.3.6 Association Expression Summary 5.4 The Spectrum of Expression |
| Record Nr. | UNINA-9910877601603321 |
|
Fant Karl M
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logically determined design [[electronic resource] ] : clockless system design with NULL convention logic / / Karl M. Fant
| Logically determined design [[electronic resource] ] : clockless system design with NULL convention logic / / Karl M. Fant |
| Autore | Fant Karl M |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, NJ, : John Wiley & Sons, 2005 |
| Descrizione fisica | 1 online resource (310 p.) |
| Disciplina | 621.381 |
| Soggetto topico |
Asynchronous circuits - Design and construction
Logic, Symbolic and mathematical Logic design Computer architecture |
| ISBN |
1-280-25243-X
9786610252435 0-470-32394-9 0-471-70287-0 0-471-70289-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
LOGICALLY DETERMINED DESIGN; CONTENTS; Preface; Acknowledgments; 1. Trusting Logic; 1.1 Mathematicianless Enlivenment of Logic Expression; 1.2 Emulating the Mathematician; 1.3 Supplementing the Expressivity of Boolean Logic; 1.3.1 The Expressional Insufficiency of Boolean Logic; 1.3.2 Supplementing the Logical Expression; 1.3.3 Coordinating Combinational Expressions; 1.3.4 The Complexity Burden of the Time Interval; 1.3.5 Forms of Supplementation Other Than the Time Interval; 1.3.6 The Complexity Burden of Asynchronous Design; 1.3.7 The Cost of Supplementation
1.4 Defining a Sufficiently Expressive Logic1.4.1 Logically Expressing Data Presentation Boundaries; 1.4.2 Logically Recognizing Data Presentation Boundaries; 1.4.3 Logically Coordinating the Flow of Data; 1.4.4 Mathematicianless Completeness of Expression; 1.5 The Logically Determined System; 1.6 Trusting the Logic: A Methodology of Logical Confidence; 1.7 Summary; 1.8 Exercises; 2. A Sufficiently Expressive Logic; 2.1 Searching for a New Logic; 2.1.1 Expressing Discrete Data Presentation Boundaries; 2.1.2 Logically Recognizing Discrete Data Presentation Boundaries 2.1.3 The Universality of the NULL Function2.1.4 Bounding the Behavior of a Combinational Expression; 2.1.5 Relationship of 4NCL to Boolean Logic; 2.2 Deriving a 3 Value Logic; 2.2.1 Expressing 3NCL State-holding Behavior; 2.2.2 3NCL Summary; 2.3 Deriving a 2 Value Logic; 2.3.1 The Data Differentiation Convention; 2.3.2 2NCL as a Threshold Logic; 2.3.3 2NCL in Relation to Boolean Logic; 2.3.4 Subvariable Expressivity; 2.3.5 Completeness at the Variable Level; 2.3.6 The 2NCL Orphan Path; 2.3.7 2NCL Summary; 2.4 Compromising Logical Completeness 2.4.1 Moving Logically Determined Completeness Boundaries Farther Apart2.4.2 No Logically Determined Boundaries in Data Path; 2.4.3 No Logically Determined Boundaries at All; 2.5 Summary; 3. The Structure of Logically Determined Systems; 3.1 The Cycle; 3.1.1 The Ring Oscillator; 3.1.2 Oscillator Composition with Shared Completeness Path; 3.1.3 Cycles and 2NCL Data Paths; 3.1.4 Data Path Abstraction; 3.1.5 Composition in Terms of Cycles; 3.1.6 Composition in Terms of Registration Stages; 3.2 Basic Pipeline Structures; 3.2.1 Pipeline Fan-out; 3.2.2 Pipeline Fan-in; 3.2.3 The Pipeline Ring 3.2.4 Cycle Structure Example3.3 Control Variables and Wavefront Steering; 3.3.1 Steering Control Variables; 3.3.2 Fan-out Wavefront Steering; 3.3.3 Fan-in Wavefront Steering; 3.3.4 Wavefront Steering Philosophy; 3.3.5 Concurrent Pipelined Function Paths; 3.4 The Logically Determined System; 3.4.1 Managing Wavefront Interaction; 3.4.2 A Simple Example System; 3.5 Initialization; 3.5.1 Initializing the System; 3.5.2 Initializing Data Wavefronts; 3.6 Testing; 3.7 Summary; 3.8 Exercises; 4. 2NCL Combinational Expression; 4.1 Function Classification; 4.1.1 Threshold Function Classification 4.1.2 Boolean Function Classification |
| Record Nr. | UNINA-9910146070003321 |
|
Fant Karl M
|
||
| Hoboken, NJ, : John Wiley & Sons, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logically determined design : clockless system design with NULL convention logic / / Karl M. Fant
| Logically determined design : clockless system design with NULL convention logic / / Karl M. Fant |
| Autore | Fant Karl M |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, NJ, : John Wiley & Sons, 2005 |
| Descrizione fisica | 1 online resource (310 p.) |
| Disciplina | 621.381 |
| Soggetto topico |
Asynchronous circuits - Design and construction
Logic, Symbolic and mathematical Logic design Computer architecture |
| ISBN |
1-280-25243-X
9786610252435 0-470-32394-9 0-471-70287-0 0-471-70289-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
LOGICALLY DETERMINED DESIGN; CONTENTS; Preface; Acknowledgments; 1. Trusting Logic; 1.1 Mathematicianless Enlivenment of Logic Expression; 1.2 Emulating the Mathematician; 1.3 Supplementing the Expressivity of Boolean Logic; 1.3.1 The Expressional Insufficiency of Boolean Logic; 1.3.2 Supplementing the Logical Expression; 1.3.3 Coordinating Combinational Expressions; 1.3.4 The Complexity Burden of the Time Interval; 1.3.5 Forms of Supplementation Other Than the Time Interval; 1.3.6 The Complexity Burden of Asynchronous Design; 1.3.7 The Cost of Supplementation
1.4 Defining a Sufficiently Expressive Logic1.4.1 Logically Expressing Data Presentation Boundaries; 1.4.2 Logically Recognizing Data Presentation Boundaries; 1.4.3 Logically Coordinating the Flow of Data; 1.4.4 Mathematicianless Completeness of Expression; 1.5 The Logically Determined System; 1.6 Trusting the Logic: A Methodology of Logical Confidence; 1.7 Summary; 1.8 Exercises; 2. A Sufficiently Expressive Logic; 2.1 Searching for a New Logic; 2.1.1 Expressing Discrete Data Presentation Boundaries; 2.1.2 Logically Recognizing Discrete Data Presentation Boundaries 2.1.3 The Universality of the NULL Function2.1.4 Bounding the Behavior of a Combinational Expression; 2.1.5 Relationship of 4NCL to Boolean Logic; 2.2 Deriving a 3 Value Logic; 2.2.1 Expressing 3NCL State-holding Behavior; 2.2.2 3NCL Summary; 2.3 Deriving a 2 Value Logic; 2.3.1 The Data Differentiation Convention; 2.3.2 2NCL as a Threshold Logic; 2.3.3 2NCL in Relation to Boolean Logic; 2.3.4 Subvariable Expressivity; 2.3.5 Completeness at the Variable Level; 2.3.6 The 2NCL Orphan Path; 2.3.7 2NCL Summary; 2.4 Compromising Logical Completeness 2.4.1 Moving Logically Determined Completeness Boundaries Farther Apart2.4.2 No Logically Determined Boundaries in Data Path; 2.4.3 No Logically Determined Boundaries at All; 2.5 Summary; 3. The Structure of Logically Determined Systems; 3.1 The Cycle; 3.1.1 The Ring Oscillator; 3.1.2 Oscillator Composition with Shared Completeness Path; 3.1.3 Cycles and 2NCL Data Paths; 3.1.4 Data Path Abstraction; 3.1.5 Composition in Terms of Cycles; 3.1.6 Composition in Terms of Registration Stages; 3.2 Basic Pipeline Structures; 3.2.1 Pipeline Fan-out; 3.2.2 Pipeline Fan-in; 3.2.3 The Pipeline Ring 3.2.4 Cycle Structure Example3.3 Control Variables and Wavefront Steering; 3.3.1 Steering Control Variables; 3.3.2 Fan-out Wavefront Steering; 3.3.3 Fan-in Wavefront Steering; 3.3.4 Wavefront Steering Philosophy; 3.3.5 Concurrent Pipelined Function Paths; 3.4 The Logically Determined System; 3.4.1 Managing Wavefront Interaction; 3.4.2 A Simple Example System; 3.5 Initialization; 3.5.1 Initializing the System; 3.5.2 Initializing Data Wavefronts; 3.6 Testing; 3.7 Summary; 3.8 Exercises; 4. 2NCL Combinational Expression; 4.1 Function Classification; 4.1.1 Threshold Function Classification 4.1.2 Boolean Function Classification |
| Record Nr. | UNINA-9910813378203321 |
|
Fant Karl M
|
||
| Hoboken, NJ, : John Wiley & Sons, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||