Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei ...
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used ...
David A. Bader, Bernard M. E. Moret, Peter Sanders
The widespread diffusion of mobile computing along with the integration of telecommunication systems and the Internet enables a scenario where the promise of ubiquitous computing ...
Dario Bottazzi, Antonio Corradi, Rebecca Montanari
This paper argues that "formal methods" can (continue to) provide the thinking tools for the future of computing science. Every significant engineering or scientific disc...