Algorithms for Constructing Computably Enumerable Sets

Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques us...

Whakaahuatanga katoa

Ngā taipitopito rārangi puna kōrero

Kaituhi matua:	Supowit, Kenneth J. (Author)
Kaituhi rangatōpū:	SpringerLink (Online service)
Hōputu:	Tāhiko īPukapuka
Reo:	Ingarihi
I whakaputaina:	Cham : Springer International Publishing : Imprint: Birkhäuser, 2023.
Putanga:	1st ed. 2023.
Rangatū:	Computer Science Foundations and Applied Logic,
Ngā marau:	Computer science. Computable functions. Recursion theory. Set theory. Computer science > Mathematics. Theory of Computation. Computability and Recursion Theory. Set Theory. Theory and Algorithms for Application Domains. Mathematics of Computing.
Urunga tuihono:	https://doi.org/10.1007/978-3-031-26904-2
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!