2008 | ||
---|---|---|
5 | EE | Wiktor Danko: Remarks on Computer Simulations Based on Algorithms of High Complexity. CISIM 2008: 239-243 |
1993 | ||
4 | Wiktor Danko: The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram. Fundam. Inform. 19(3/4): 417-431 (1993) | |
1986 | ||
3 | Wiktor Danko: First-Order Approximation of Algorithmic Theories. Theor. Comput. Sci. 48(3): 257-272 (1986) | |
1981 | ||
2 | Wiktor Danko: A Criterion of Undecidability of Algorithmic Theories. Fundam. Inform. 4(3): 605-628 (1981) | |
1980 | ||
1 | Wiktor Danko: A Criterion of Undecidability of Algorithmic Theories. MFCS 1980: 205-218 |