Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Synthetic Kolmogorov complexity in coq

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

DOI10.4230/LIPICS.ITP.2022.12MaRDI QIDQ6572546FDOQ6572546


Authors: Yannick Forster, Fabian Kunze, Nils Lauermann Edit this on Wikidata


Publication date: 15 July 2024






zbMATH Keywords

Kolmogorov complexitycomputability theoryrandom numbersconstructive type theorycoqconstructive matemathicssynthetic computability theory


Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)







This page was built for publication: Synthetic Kolmogorov complexity in coq

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572546)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6572546&oldid=40111410"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:28. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki