Towards “Fypercomputations” (in Membrane Computing)

DOI10.1007/978-3-642-31644-9_14zbMath1367.68101OpenAlexW84880708MaRDI QIDQ3166953

Gheorghe Păun

Publication date: 1 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_14

zbMATH Keywords

complexitymembrane computinghypercomputingTuring computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

A dozen of research topics in membrane computing ⋮ Unconventional Computing: Do We Dream Too Much? ⋮ Towards bridging two cell-inspired models: P systems and R systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards bridging two cell-inspired models: P systems and R systems
• Introducing time in reaction systems
• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
• Computing with membranes
• Why there is no such discipline as hypercomputation
• Hypercomputation
• Developments in Language Theory
• Membrane Computing
• Aspects of Molecular Computing
• On P systems with membrane creation

This page was built for publication: Towards “Fypercomputations” (in Membrane Computing)