Papers for the Seminar
- C. Calude.
Random Questions on the Third Culture
- C. Calude. The
Concept of Complexity
- C. Calude.
Is Computer Science A Science? (slides)
Technical Papers
-
C.Calude (ed.)
Proceedings of the Summer School "Chaitin Complexity and Applications",
Mangalia, Romania,
27 June -- 6 July, 1995,
J. UCS
5(1996), 242-441.
-
C. Calude. What is a random string?
J. UCS 1 (1995), 48-66.
-
C. Calude, D. I. Campbell, K. Svozil, D. Stefanescu.
Strong determinism vs. computability, in
W. Depauli-Schimanovich,
E. Koehler, F. Stadler (eds.).
The Foundational Debate, Complexity and Constructivity
in Mathematics and Physics,
Kluwer, Dordrecht, 1995, 115-131.
-
C. Calude, C. Câmpeanu. Are binary
codings universal?,
Complexity 5 (1996).
- C. Calude, J. Hromkovic.
Complexity: A Language-Theoretic Point of View,
CDMTCS Research Report Ê 009,
1995, 47 pp.
-
C. Calude, H. Jürgensen, M. Zimand. Is independence an
exception?,
Appl. Math. Comput. 66 (1994), 63-76.
-
C. Calude, S. Marcus, D. Stefanescu.
The Creator
versus its creation. From
Scotus to Gödel, (to appear)
-
C. Calude, A. Salomaa. Algorithmically coding the
universe, in G. Rozenberg,
A. Salomaa (eds.). Developments in Language Theory, World Scientific,
Singapore, 1994, 472-492.
-
G. J. Chaitin, A. Arslanov, C. Calude.
Program-size complexity computes the halting
problem, EATCS Bull., 57 (1995), 198-200 or
CDMTCS Research
Report.