A Criterion of Undecidability of Algorithmic Theories. - Wiktor Danko (Fundam. Informaticae, 1981)

First-Order Approximation of Algorithmic Theories. - Wiktor Danko (Theor. Comput. Sci., 1986)

The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram. - Wiktor Danko (Fundam. Informaticae, 1993)

Modelling using probabilistic algorithms. - Anna Borowska; Wiktor Danko; Joanna Karbowska-Chilinska (Information Processing and Security Systems, 2005)

Remarks on Computer Simulations. - Wiktor Danko (Biometrics, Computer Security Systems and Artificial Intelligence Applications, 2006)

Remarks on Computer Simulations Based on Algorithms of High Complexity. - Wiktor Danko (CISIM, 2008)