We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipa...
Internet software tightly integrates classic computation with communication software. Heterogeneity and complexity can be tackled with a component-based approach, where components ...