Coverart for item
The Resource Machines, computations, and universality : 5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings, Jérôme Durand-Lose, Maurice Margenstern (eds.)

Machines, computations, and universality : 5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings, Jérôme Durand-Lose, Maurice Margenstern (eds.)

Label
Machines, computations, and universality : 5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings
Title
Machines, computations, and universality
Title remainder
5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings
Statement of responsibility
Jérôme Durand-Lose, Maurice Margenstern (eds.)
Title variation
MCU 2007
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 10-13, 2007. The 18 revised full papers presented together with 9 invited papers were carefully reviewed and selected. The topics include Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing
Member of
Is part of
Cataloging source
GW5XE
Dewey number
004
Illustrations
illustrations
Index
index present
LC call number
QA75.5
LC item number
.M396 2007eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2007
http://bibfra.me/vocab/lite/meetingName
MCU 2007
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Durand-Lose, Jérôme
  • Margenstern, Maurice
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
4664
http://library.link/vocab/subjectName
  • Computer science
  • Computer logic
  • Cellular automata
  • Molecular computers
  • Turing machines
  • Computer programming
  • Computer logic
  • Cellular automata
  • Molecular computers
  • Turing machines
  • Computer programming
  • Computer science
  • Informatique
  • Cellular automata
  • Computer logic
  • Computer programming
  • Computer science
  • Molecular computers
  • Turing machines
Label
Machines, computations, and universality : 5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings, Jérôme Durand-Lose, Maurice Margenstern (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- Encapsulating Reaction-Diffusion Computers -- On the Computational Capabilities of Several Models -- Universality, Reducibility, and Completeness -- Using Approximation to Relate Computational Classes over the Reals -- A Survey of Infinite Time Turing Machines -- The Tiling Problem Revisited (Extended Abstract) -- Decision Versus Evaluation in Algebraic Complexity -- A Universal Reversible Turing Machine -- P Systems and Picture Languages -- Regular Papers -- Partial Halting in P Systems Using Membrane Rules with Permitting Contexts -- Uniform Solution of QSAT Using Polarizationless Active Membranes -- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem -- Planar Trivalent Network Computation -- On the Power of Networks of Evolutionary Processors -- Study of Limits of Solvability in Tag Systems -- Query Completeness of Skolem Machine Computations -- More on the Size of Higman-Haines Sets: Effective Constructions -- Insertion-Deletion Systems with One-Sided Contexts -- Accepting Networks of Splicing Processors with Filtered Connections -- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata -- Four Small Universal Turing Machines -- Changing the Neighborhood of Cellular Automata -- A Simple P-Complete Problem and Its Representations by Language Equations -- Slightly Beyond Turing's Computability for Studying Genetic Programming -- A Smallest Five-State Solution to the Firing Squad Synchronization Problem -- Small Semi-weakly Universal Turing Machines -- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
Control code
184941255
Dimensions
unknown
Extent
1 online resource (x, 324 pages)
Form of item
online
Isbn
9781281353771
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-540-74593-8
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-74592-1
Specific material designation
remote
System control number
(OCoLC)184941255
Label
Machines, computations, and universality : 5th international conference, MCU 2007, Orleans, France, September 10-13, 2007 : proceedings, Jérôme Durand-Lose, Maurice Margenstern (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited Talks -- Encapsulating Reaction-Diffusion Computers -- On the Computational Capabilities of Several Models -- Universality, Reducibility, and Completeness -- Using Approximation to Relate Computational Classes over the Reals -- A Survey of Infinite Time Turing Machines -- The Tiling Problem Revisited (Extended Abstract) -- Decision Versus Evaluation in Algebraic Complexity -- A Universal Reversible Turing Machine -- P Systems and Picture Languages -- Regular Papers -- Partial Halting in P Systems Using Membrane Rules with Permitting Contexts -- Uniform Solution of QSAT Using Polarizationless Active Membranes -- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem -- Planar Trivalent Network Computation -- On the Power of Networks of Evolutionary Processors -- Study of Limits of Solvability in Tag Systems -- Query Completeness of Skolem Machine Computations -- More on the Size of Higman-Haines Sets: Effective Constructions -- Insertion-Deletion Systems with One-Sided Contexts -- Accepting Networks of Splicing Processors with Filtered Connections -- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata -- Four Small Universal Turing Machines -- Changing the Neighborhood of Cellular Automata -- A Simple P-Complete Problem and Its Representations by Language Equations -- Slightly Beyond Turing's Computability for Studying Genetic Programming -- A Smallest Five-State Solution to the Firing Squad Synchronization Problem -- Small Semi-weakly Universal Turing Machines -- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
Control code
184941255
Dimensions
unknown
Extent
1 online resource (x, 324 pages)
Form of item
online
Isbn
9781281353771
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-540-74593-8
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-74592-1
Specific material designation
remote
System control number
(OCoLC)184941255

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...