In this paper, I want to deal with the triviality threat to computationalism. On one hand, the controversial and vague claim that cognition involves computation is still denied. On the other, contemporary physicists and philosophers alike claim that all physical processes are indeed computational or algorithmic. This claim would justify the computationalism claim by making it utterly trivial. I...

We prove that given any knot k of genus g, k fails to be strongly n-trivial for all n, n ≥ 3g − 1.

In recent years, combinations of terms have become popular where one component is „computational“ or some relative of it, whereas the other is „aesthetics“ or „art“ or „creativity“, etc. The Dagstuhl seminar, to which this personal note owes its appearance, had the number 09291 and the title Computational Creativity: an Interdisciplinary Approach. Good old C. P. Snow would probably like such te...

We develop an intersection theory for a singular hermitian line bundle with positive curvature current on a smooth projective variety and irreducible curves on the variety. And we prove the existence of a natural rational fibration structure associated with the singular hermitian line bundle. Also for any pseudoeffective line bundle on a smooth projective variety, we prove the existence of a na...