EUVIMEDEUVIMED entdecken
Crossref

B. Kjos-Hanssen, Automatic Complexity: A Computable Measure of Irregularity. De Gruyter Series in Logic and Its Applications, vol. 12. De Gruyter, Berlin/Boston, 2024, xii + 144 pp.

William Gasarch

The Bulletin of Symbolic Logic · 30.10.2026 · 1-2

DOI: 10.1017/bsl.2026.10194 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, online erschienen am 30.10.2026. Verfasst von William Gasarch.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Gasarch, W. (2026). B. Kjos-Hanssen, Automatic Complexity: A Computable Measure of Irregularity. De Gruyter Series in Logic and Its Applications, vol. 12. De Gruyter, Berlin/Boston, 2024, xii + 144 pp. The Bulletin of Symbolic Logic, 1-2. https://doi.org/10.1017/bsl.2026.10194

Vancouver

Gasarch W. B. Kjos-Hanssen, Automatic Complexity: A Computable Measure of Irregularity. De Gruyter Series in Logic and Its Applications, vol. 12. De Gruyter, Berlin/Boston, 2024, xii + 144 pp. The Bulletin of Symbolic Logic. 2026:1-2. doi:10.1017/bsl.2026.10194

BibTeX
@article{Gasarch2026,
  author = {Gasarch, William},
  title = {B. Kjos-Hanssen, Automatic Complexity: A Computable Measure of Irregularity. De Gruyter Series in Logic and Its Applications, vol. 12. De Gruyter, Berlin/Boston, 2024, xii + 144 pp},
  journal = {The Bulletin of Symbolic Logic},
  year = {2026},
  pages = {1--2},
  doi = {10.1017/bsl.2026.10194}
}
Kostenlos starten →