Machines, Computations, and Universality (Record no. 188214)

MARC details
000 -LEADER
fixed length control field 05666nam a22005775i 4500
001 - CONTROL NUMBER
control field 978-3-540-45132-7
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132459.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s2001 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540451327
-- 978-3-540-45132-7
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-45132-3
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Machines, Computations, and Universality
Medium [electronic resource] :
Remainder of title Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings /
Statement of responsibility, etc edited by Maurice Margenstern, Yurii Rogozhin.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2001.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2001.
300 ## - PHYSICAL DESCRIPTION
Extent VIII, 328 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 2055
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Lectures Notes -- Three Small Universal Turing Machines -- Computation in Gene Networks -- Power, Puzzles and Properties of Entanglement -- Combinatorial and Computational Problems on Finite Sets of Words -- Computing with Membranes (P Systems): Universality Results -- A Simple Universal Logic Element and Cellular Automata for Reversible Computing -- Some Applications of the Decidability of DPDA’s Equivalence -- The Equivalence Problem for Computational Models: Decidable and Undecidable Cases -- Two Normal Forms for Rewriting P Systems -- Technical Contributions -- On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations -- On the Transition Graphs of Turing Machines -- JC-Nets -- JC-Nets -- Nonterminal Complexity of Programmed Grammars -- Nonterminal Complexity of Programmed Grammars -- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars -- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars -- A Direct Construction of a Universal Extended H System -- A Direct Construction of a Universal Extended H System -- Speeding-Up Cellular Automata by Alternations -- Speeding-Up Cellular Automata by Alternations -- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity -- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity -- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints -- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints -- P Systems with Membrane Creation: Universality and Efficiency -- P Systems with Membrane Creation: Universality and Efficiency -- On the Computational Power of a Continuous-space Optical Model of Computation -- On theComputational Power of a Continuous-space Optical Model of Computation -- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT) -- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT) -- D0L System + Watson-Crick Complementarity = Universal Computation -- D0L System + Watson-Crick Complementarity = Universal Computation.
520 ## - SUMMARY, ETC.
Summary, etc In the ?rst part of the present volume of LNCS, the reader will ?nd the invited talks given at the MCU 2001 conference. In the second part, he/she will ?nd the contributions that were presented at the conference after selection. In both cases, papers are arranged in the alphabetical order of the authors. MCU 2001 is the third conference in theoretical computer science, Machines, computations and universality, formerly, Machines et calculs universels. Both previous conferences, MCU’95 and MCU’98, were organized by Maurice M- genstern in Paris and in Metz (France), respectively. From the very beginning, MCU conferences have been an international sci- ti?c event. For the third conference, in order to stress that aspect, it was decided to hold it outside France. Moldova was chosen thanks to the close cooperation between the present chairmen of MCU 2001. MCU 2001 also aims at high scienti?c standards. We hope that the present volume will convince the reader that the tradition of previous conferences have been upheld by this one. Cellular automata and molecular computing are well represented in this volume. And this is also the case for quantum computing, f- mal languages, and the theory of automata. MCU 2001 does not fail its tradition of providing our community with important results on Turing machines.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Machine theory.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science Logic and Foundations of Programming.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Formal Languages and Automata Theory.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Margenstern, Maurice.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rogozhin, Yurii.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540421214
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662202159
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 2055
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/3-540-45132-3">https://doi.org/10.1007/3-540-45132-3</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in