Profile

In this forum we are going to discuss several topics on Computability and Complexity theory mainly for discrete systems such as Turing machines, cellular automata, register machines, tag systems, sk combinators, substitution systems, neural networks, axiom systems and recursive functions towards a wide vision towards the foundations of computing. The forum might be useful to promote the field, announce events and conference and make contact with other groups in Boston and greater Boston where many schools and organizations with strong interests in this topics exist.

Admin contact:

Hector Zenil