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

scientific article; zbMATH DE number 1390017

From MaRDI portal
Jump to:navigation, search

zbMATH Open0939.03045MaRDI QIDQ4934282FDOQ4934282


Authors: Robert I. Soare Edit this on Wikidata


Publication date: 29 June 2000



Title of this publication is not available (Why is that?)



Recommendations

  • On a Class of Recursively Enumerable Sets
  • Computably enumerable sets and related issues
  • The computably enumerable sets: recent results and future directions
  • scientific article; zbMATH DE number 4091484
  • scientific article; zbMATH DE number 871851


zbMATH Keywords

computably enumerable sets


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)



Cited In (8)

  • Computing sets from all infinite subsets
  • Title not available (Why is that?)
  • Some recent research directions in the computably enumerable sets
  • Definable properties of the computably enumerable sets
  • Computably enumerable sets below random sets
  • Computably enumerable sets and related issues
  • Computably enumerable sets and quasi-reducibility
  • Turing oracle machines, online computing, and three displacements in computability theory





This page was built for publication:

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

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