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

Computability and complexity

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

MaRDI QIDQ5871908FDOQ5871908


Authors: Hubie Chen Edit this on Wikidata


Publication date: 25 January 2023





Recommendations

  • Limits of computation. An introduction to the undecidable and the intractable
  • Computability and complexity. Foundations and tools for pursuing scientific applications
  • What can be computed? A practical guide to the theory of computation
  • Concise guide to computation theory.
  • Computability and complexity theory.


Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx)







This page was built for publication: Computability and complexity

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5871908&oldid=30736371"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 05:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki