Computability Theory

Computability and computable enumerability are two of the fundamental notions of mathematics. Interest in effectiveness is already apparent in the famous Hilbert problems, in particular the second and tenth, and in early 20th century work of Dehn, initiating the study of word problems in group theory. The last decade has seen both completely new subareas develop as well as remarkable growth in two-way interactions between classical computability theory and areas of applications. There is also a great deal of work on algorithmic randomness, reverse mathematics, computable analysis, and in computable structure theory/computable model theory. The goal of this workshop is to bring together researchers representing different aspects of computability theory to discuss recent advances, and to stimulate future work

Notes in Pure Mathematics & Mathematical Structures in Physics

These Notes deal with various areas of mathematics, and seek reciprocal combinations, explore mutual relations, ranging from abstract objects to problems in physics.Comment: Small improvements and addition

Feynman categories and representation theory

We give a presentation of Feynman categories from a representation--theoretical viewpoint. Feynman categories are a special type of monoidal categories and their representations are monoidal functors. They can be viewed as a far reaching generalization of groups, algebras and modules. Taking a new algebraic approach, we provide more examples and more details for several key constructions. This leads to new applications and results. The text is intended to be a self--contained basis for a crossover of more elevated constructions and results in the fields of representation theory and Feynman categories, whose applications so far include number theory, geometry, topology and physics