Biochemical Busy Beaver

Synthesis of Busy Beaver in Biochemical Automaton Space Genetic Algorithm Software Flow Internal Internal External Internal Internal Internal Chromosome Farmer Visualiser {} [ 1 {('a', 1)} {r 1 : {('a', 1)} ---> {(('a', 0), 2)}, r 2 : {('a', 1)} ---> {(('a', 0), 1), (('b', 0), 1)}, r 3 : {('a', 1), ('b', 1)} ---> {(('b', 0), 2)}} {} ] 1 Run Replicate & Crossover Membranes of two individuals are swapped Mutations Rules in a membrane are randomly changed External A Internal External B 1 2 4 5 Running Initialise the population of random individuals... Rank individuals based on their productivity... Select and recombine... Terminate or continue... 3 Preserve elite chromosomes... Initial analysis of the output Removing duplicate rules Removing identity rules Deciding if the individual halts..? Preparing the input file #beaver {} [ 1 {('a', 1)} {r 1 : {('a', 1)} ---> {(('a', 0), 2)}, r 2 : {('a', 1)} ---> {(('a', 0), 1), (('b', 0), 1)}, r 3 : {('a', 1), ('b', 1)} ---> {(('b', 0), 2)}} {} ] 1 #output [('a', 1)] [('a', 1), ('b', 1)] [('b', 2)] #output [('a',1)] #beaver ... [('b',12),('a',3)] [('b',17),('a',1)] [('b',17),('a',2)] [('b',18),('a',3)] [('b',19),('a',5)] [('b',24),('a',5)] [('b',28),('a',6)] [('b',33),('a',7)] [('b',42),('a',5)] [('b',1),('a',1)] [('b',1),('a',2)] [('b',1),('a',4)] [('b',3),('a',6)] [('b',47),('a',5)] [('b',49),('a',8)] [('b',57),('a',8)] [('b',66),('a',7)] [('b',71),('a',9)] [('b',80),('a',9)] [('b',90),('a',8)] [('b',343),('a',21)] [('b',369),('a',16)] [('b',385),('a',16)] [('b',401),('a',16)] [('b',422),('a',11)] [('b',432),('a',12)] [('b',450),('a',6)] [('b',455),('a',7)] [('b',461),('a',8)] [('b',471),('a',6)] [('b',478),('a',5)] [('b',485),('a',3)] [('b',488),('a',3)] [('b',491),('a',3)] [('b',494)] [('b',95),('a',11)] [('b',101),('a',16)] [('b',114),('a',19)] [('b',133),('a',19)] [('b',154),('a',17)] [('b',175),('a',13)] [('b',186),('a',15)] [('b',198),('a',18)] [('b',218),('a',16)] [('b',232),('a',18)] [('b',252),('a',16)] [('b',268),('a',16)] [('b',280),('a',20)] [('b',299),('a',21)] [('b',318),('a',23)] 3. a -> bc 3. a -> b 1: a -> ac 2: bc -> aa Input file Main functions: Parse the input Collect the data Plot datapoints representing the P System External c -> bd ad -> cc biochemical molecules biochemical reactions What's inside? Rules: Objects: a b b c d d a Introduction Summary Visualisation of multiple runs Define BBP for P System Produce software that search for busy beavers Analyse the final results (instead of classic Turing Machine) (using a method that mimics natural evolution) i.e. what have we found in computational universe? Project Objectives: The Farm Process of natural evolution is simulated. We look for biologicaly inspired systems which produce maximal output and die. Evolution trajectories of the most productive machine are visualised and analysed. Can we already find (or synthesise) Biochemical Busy Beavers in the natural environment? What would the implications be on life on Earth as we know it? How evolution looks like? A simple Busy Beaver Simple input Simple evolution? Some systems are "ugly"