1 option
Machines, Computations, and Universality : 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers / edited by Maurice Margenstern.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3354.
- Theoretical Computer Science and General Issues ; 3354
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- Computer logic.
- Algorithms.
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Algorithm Analysis and Problem Complexity.
- Local Subjects:
- Computation by Abstract Devices.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Algorithm Analysis and Problem Complexity.
- Physical Description:
- 1 online resource (VIII, 328 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- Invited Lectures
- Algorithmic Randomness, Quantum Physics, and Incompleteness
- On the Complexity of Universal Programs
- Finite Sets of Words and Computing
- Universality and Cellular Automata
- Leaf Language Classes
- Selected Contributions
- Computational Completeness of P Systems with Active Membranes and Two Polarizations
- Computing with a Distributed Reaction-Diffusion Model
- Computational Universality in Symbolic Dynamical Systems
- Real Recursive Functions and Real Extensions of Recursive Functions
- Ordering and Convex Polyominoes
- Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages
- Evolution and Observation: A Non-standard Way to Accept Formal Languages
- The Computational Power of Continuous Dynamic Systems
- Abstract Geometrical Computation for Black Hole Computation
- Is Bosco's Rule Universal?
- Sequential P Systems with Unit Rules and Energy Assigned to Membranes
- Hierarchies of DLOGTIME-Uniform Circuits
- Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays
- Register Complexity of LOOP-, WHILE-, and GOTO-Programs
- Classification and Universality of Reversible Logic Elements with One-Bit Memory
- Universal Families of Reversible P Systems
- Solving 3CNF-SAT and HPP in Linear Time Using WWW
- Completing a Code in a Regular Submonoid of the Free Monoid
- On Computational Universality in Language Equations
- Attacking the Common Algorithmic Problem by Recognizer P Systems
- On the Minimal Automaton of the Shuffle of Words and Araucarias.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-31834-7
- 9783540318347
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.