λP systems and typed λ-calculus

Authors:
Loïc Colson;Nataša Jonoska;Maurice Margenstern
Affiliations:
LITA, EA 3097, Université de Metz, UFR MIM, Metz, Cédex, France;Department of Mathematics, University of South-Florida, Tampa, FL;LITA, EA 3097, Université de Metz, UFR MIM, Metz, Cédex, France
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 7
Cited 0

Lambda-calculus, types and models

Lambda-calculus, types and models
P systems with active membranes: attacking NP-complete problems

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

Membrane Computing: An Introduction
A guide to membrane computing

Theoretical Computer Science - Natural computing
On P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Tree operations in P systems and λ-calculus

Fundamenta Informaticae
Tissue-like P Systems with Active Membranes for Picture Generation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this extended abstract, we recast first the implementation of tree operations in P systems with λP systems and simulation of pure λ-calculus as proposed in [6]. Further, we indicate a similar way to implement Gödel's T-systems. This provides a family of P systems with each system implementing a family of total recursive functions. The union of the implemented functions coincides with the set of provably total recursive functions in Peano arithmetic.