Computing with P Systems

TL;DR

This paper introduces a new encoding of recursive functions into P systems with graph-like structures, advancing the potential for implementing programming languages on hardware using P systems.

Contribution

It presents a novel encoding method for recursive functions in P systems, enhancing their applicability for real programming language implementation.

Findings

New encoding of recursive functions in P systems

Establishes a foundation for hardware implementation of programming languages

Demonstrates P systems' computational power beyond Turing machines

Abstract

P systems are computing conceptual computing devices that are at least as powerful as Turing machines. However, until recently it was not known how one can encode any recursive function as a P~system. Here we propose a new encoding of recursive as P~systems with graph-like structure, which is the main difference with previous documented attempts. The consequence of this and other such efforts is that they provide a solid ground for the implementation of real programming languages in existing hardware.