Sciweavers

    MCU
    1998
    119views Hardware» more  MCU 1998»
    DNA Computing Based on Splicing: Universality Results
    13 years 6 months ago
    DNA Computing Based on Splicing: Universality Results
    Download  psb.stanford.edu
    The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
    Gheorghe Paun
    claim paper
    Read More »
    MCU
    1998
    93views Hardware» more  MCU 1998»
    Using DNA to solve the Bounded Post Correspondence Problem
    13 years 6 months ago
    Using DNA to solve the Bounded Post Correspondence Problem
    Download  www.cs.tau.ac.il
    Lila Kari, Greg Gloor, Sheng Yu
    claim paper
    Read More »
    MCU
    1998
    154views Hardware» more  MCU 1998»
    A computation-universal two-dimensional 8-state triangular reversible cellular automaton
    13 years 6 months ago
    A computation-universal two-dimensional 8-state triangular reversible cellular automaton
    Download  www.iec.hiroshima-u.ac.jp
    A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
    Katsunobu Imai, Kenichi Morita
    claim paper
    Read More »
    MCU
    1998
    170views Hardware» more  MCU 1998»
    About the Universality of the Billiard ball model
    13 years 6 months ago
    About the Universality of the Billiard ball model
    Download  www.univ-orleans.fr
    Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
    Jérôme Olivier Durand-Lose
    claim paper
    Read More »
    MCU
    1998
    117views Hardware» more  MCU 1998»
    The Turing Closure of an Archimedean Field
    13 years 6 months ago
    The Turing Closure of an Archimedean Field
    Download  vigna.dsi.unimi.it
    A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
    Paolo Boldi, Sebastiano Vigna
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.