Research Group on Natural Computing

We present several results concerning the computational power and complexity of Accepting Networks of Splicing Processors (ANSP). We show that every recursively enumerable language can be accepted by an ANSP of size 7 out of which 6 do not depend on the given language. Then we propose a method for constructing, given an NP-language, an ANSP of size 7 accepting that language in polynomial time. Unlike the previous case, all nodes of this ANSP depend on the given language.

Prof. Dr. Vladimir Komendantsky

INRIA Sophia Antipolis, France

Abstract:

In my talk I briefly introduce a powerful proof assistant Coq, one of the most widely used automated
theorem proving tools today.
I illustrate the uses of Coq by providing several methods allowing to incorporate general recursive
(e.g., potentially non-terminating) recursive functions inside the underlying theory of this proof assistant.

"Residencia Universitaria Rector Estanislao del Campo"
Address: C/Guadalbullón, esq. Carretera su Eminencia s/n

It is about 15 minutes walking from the venue. The fee for a single room with kitchen is 40 €/day. It includes basic kitchenware, sheets and towels. There are also other services (to be booked):

- Breakfast: 3€
- One meal (lunch/dinner): 6€
- Breakfast + One meal (Media Pensión): 8€
- Breakfast + Two meals (Pensión completa): 13€

Actividades realizadas en 2013 dentro del marco del Proyecto de Excelencia:

1. Organización del Second International School on Biomolecular and Biocellular Computing, celebrado en Madrid del 23 al 25 de septiembre de 2013.
2. Organización del Eleventh Brainstorming Week on Membrane Computing, celebrado en Sevilla del 4 al 8 de febrero de 2013.