Sciweavers

152 search results - page 1 / 31
» Parallel Feedback Turing Computability
Sort
View
CIE
2005
Springer
13 years 10 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose
ECAL
2007
Springer
13 years 10 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
SOFSEM
2001
Springer
13 years 9 months ago
Pipelined Decomposable BSP Computers
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
Martin Beran
CONCUR
2003
Springer
13 years 9 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov