American Psychological Association 6th edition

BURGIN, M. (2007, Januar 1). Algorithmic complexity as a criterion of unsolvability. 383(2-3). Amsterdam: Elsevier, 2007. Abgerufen von http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061047

ISO-690 (author-date, English)

BURGIN, Mark, 2007. Algorithmic complexity as a criterion of unsolvability. In: [online]. Amsterdam: Elsevier, 2007. 1 Januar 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061047

Modern Language Association 9th edition

BURGIN, M. Algorithmic complexity as a criterion of unsolvability. Nr. 2-3, Amsterdam: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061047.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

BURGIN, M. (2007), „Algorithmic complexity as a criterion of unsolvability“, in , Bd. 383, Amsterdam: Elsevier, 2007., verfügbar unter: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19061047.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.