{'fraction_non_alphanumeric': 0.02608695652173913, 'fraction_numerical': 0.0, 'mean_word_length': 4.702970297029703, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Computing by Carving with P Systems. A First Approach

Summary. In this work, we propose a P system which carries out computing by carving. Computing by carving was proposed by Gh. P˘aun as a technique to generate formal languages which can even be non recursively enumerable. Hence, it can be considered a hypercomputational technique. Here, we propose a first scheme based on P systems in order to perform computing by carving any formal language. So, the paper shows indirectly that these systems, under certain assumptions, can be considered a model for hypercomputation.