Work

Unconventional complexity classes in unconventional computing (extended abstract)

Year: 2024

Type: preprint

Abstract: Many unconventional computing models, including some that appear to be quite different from traditional ones such as Turing machines, happen to characterise either the complexity class P or PSPACE when working in deterministic polynomial time (and in the maximally parallel way, where this applies). We discuss variants of cellular automata and membrane systems that escape this dichotomy and characterise intermediate complexity classes, usually defined in terms of Turing machines with oracles, as well as some possible reasons why this happens.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2405.16896

Author: Porreca, Antonio E.

Institutions: Centre National de la Recherche Scientifique, Aix-Marseille Université, Laboratoire d’Informatique et Systèmes

Language: English

Topic: DNA and Biological Computing

Subfield: Molecular Biology

Field: Biochemistry, Genetics and Molecular Biology

Domain: Life Sciences

Open Access status: green

Funder: HORIZON EUROPE Marie Sklodowska-Curie Actions

Award: Application-driven Challenges for Automata Networks and Complex Systems

OpenAlex ID: W4399116100

Cites:

Cited by:

Related to: 10