Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

LISP program-size complexity. IV

From MaRDI portal
Publication:1200221
Jump to:navigation, search

DOI10.1016/0096-3003(92)90102-7zbMath0757.68068OpenAlexW4247018855MaRDI QIDQ1200221

Gregory J. Chaitin

Publication date: 17 January 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(92)90102-7


zbMATH Keywords

program-size complexityLISP halting probability


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items (1)

LISP program-size complexity. III




Cites Work

  • Unnamed Item
  • LISP program-size complexity
  • LISP program-size complexity. II
  • LISP program-size complexity. III




This page was built for publication: LISP program-size complexity. IV

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1200221&oldid=13261608"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki