In this talk I revisit the idea of Eilenberg (from the book Automata, Languages and machines Vol.A 1974) to use automata labelled with relations as a general computational model. The model is now called Eilenberg machines.

Existing graph measures can retrieve certain structural information, but are not sufficient to capture all aspects of a network.

Given a function as black box, where one can only query locations in the truth table of the function and each query will be charged, by querying only three locations one can tell whether the given function is linear or not with h

I will introduce the basic definitions and framework of Kolmogorov Complexity.

An asynchronous or ``event-driven program is one that contains procedure calls which are not directly executed from the callsite, but stored and executed later by an external scheduler.