Current Trends in Theoretical Computer Science : Entering the 21st Century
G. Paun
Bok Engelsk 2001 · Electronic books.
| Annen tittel | |
|---|---|
| Utgitt | Singapore : : World Scientific Publishing Company, , 2001.
|
| Omfang | 1 online resource (881 p.)
|
| Opplysninger | Description based upon print version of record.. - Contents; Chapter 1 Computational Complexity; Introductory Remarks; A Machine Model for the Complexity of NP-Approximation Problems; Some Pointed Questions Concerning Asymptotic Lower Bounds and News from the Isomorphism Front; Propositional Proof Complexity: Past Present and Future; Progress in Descriptive Complexity; Twelve Problems in Resource-Bounded Measure; Diagonalization; Chapter 2 Formal Specification; Introductory Remarks; Theory and Practice of Software Development: A Review of Driving Forces and Expectations of TAPSOFT from 1985 to 1997. - Functions Versus AlgorithmsThe Sequential ASM Thesis; Why are Modal Logics so Robustly Decidable?; The Underlying Logic of Hoare Logic; Chapter 4 Concurrency; Introductory Remarks; Does Concurrency Theory Have Anything to Say About Parallel Programming?; Homotopy and Concurrency; Towards Global Computations Guided by Concurrency Theory; What is Branching Time Semantics and Why to Use it?; More Infinite Results; Conservative Extension in Structural Operational Semantics; Security Analysis Using Flow Logics; Chapter 5 Natural Computing; Introductory Remarks; Theory of Genetic Algorithms. - Lindenmayer and DNA: Watson-Crick D0L Systems. - On a Reference Model for the Formalization and Integration of Software Specification LanguagesOn Formal Semantics and Integration of Object-Oriented Modeling Languages; Chapter 3 Logic In Computer Science; Introductory Remarks; Characterizations of Regular Languages in Low Level Complexity Classes; AMAST'91 Banquet Talk; Logic on Words; The Value if Any of Decidability; Platonism, Constructivism and Computer Proofs vs. Proofs by Hand; Herbrand's Theorem and Equational Reasoning: Problems and Solutions; From Invariants to Canonization; The Complexity of Propositional Proofs. - On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000Algebraic Techniques in Software Development: A Review of Progress up to the Mid Nineties; CoFI: The Common Framework Initiative for Algebraic Specification and Development; GETGRATS and APPLIGRAPH: Theory and Applications of Graph Transformation; Classification of Petri Nets Using Adjoint Functors; Dynamic Abstract Data Types: An Informal Proposal in 1994; Integration Paradigm for Data Type and Process Specification Techniques; From Basic Views and Aspects to Integration of Specification Formalisms. - Why Evolutionary Algorithms?Natural Data Mining Techniques; Theoretical and Experimental DNA Computation; The Genomics Revolution and its Challenges for Algorithmic Research; An Introduction to Quantum Computing; Quantum Computing and Communication Complexity; Neural Computation: A Research Topic for Theoretical Computer Science? Some Thoughts and Pointers; Chapter 6 Formal Language Theory; Introductory Remarks; Many-Valued Truth Functions, Cernys' Conjecture and Road Coloring; On Slender Languages; Simple Words in Equality Sets; The D0L Problem Revisited. - The scientific developments at the end of the past millennium were dominated by the huge increase and diversity of disciplines with the common label "computer science". The theoretical foundations of such disciplines have become known as theoretical computer science . This book highlights some key issues of theoretical computer science as they seem to us now, at the beginning of the new millennium. The text is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science in the period 1995-2000. The columnists themselves selected the mate
|
| Emner | |
| Sjanger | |
| Dewey | |
| ISBN | 9810244738
|
