LISP program-size complexity
type: Item
instance of: scholarly article
title: LISP program-size complexity
zbMATH Open document ID: 0776.68064
DOI: 10.1016/0096-3003(92)90057-8
published in: Applied Mathematics and Computation
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 64433
zbMATH Keywords: length of programs
zbMATH Keywords: computing finite binary sequences
zbMATH Keywords: program-size complexity
author: Gregory J. Chaitin
MaRDI profile type: Publication
full work available at URL: 0096-3003(92)90057-8
OpenAlex ID: W2171509265
cites work: Information, randomness and incompleteness. Papers on algorithmic information theory
cites work: Q3995518
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: Q5724253
description: scientific article; zbMATH DE number 64433