Randomized Gandy-Păun-Rozenberg machines

Authors:
Adam Obtułowicz
Affiliations:
Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 5
Cited 1

Algebraic aspects of cryptography

Algebraic aspects of cryptography
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Research Note: Generating parallel quasirandom sequences via randomization

Journal of Parallel and Distributed Computing

Generalized gandy-păun-rozenberg machines for tile systems and cellular automata

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An idea of a randomized Gandy-Păun-Rozenberg machine providing a certain abstract implementation of concurrent (parallel) randomized algorithms is introduced. A randomized Gandy-Păun-Rozenberg machine for solving 3-SAT problem in a polynomial time with the low error probability and with subexponential number of indecomposable processors is shown. This machine assembles a distributed system which then realizes a massively parallel computation.