Introduzione alla calcolabilità e alla complessità computazionale

The computability of functions and the computational complexity of problems are classical subjects of Theoretical Computer Science. This work presents the main aspects of these topics with a didactic and educational goal. The notion of computability is related to the existence of an algorithm to det...

Ful tanımlama

Detaylı Bibliyografya

Asıl Yazarlar:	Bertoni, Alberto, Goldwurm, Massimiliano
Materyal Türü:	Online
Dil:	İtalyanca
Baskı/Yayın Bilgisi:	Milano University Press 2026
Konular:	undecidable problems recursively enumerable sets time and space complexity Np-complete problems computable functions thema EDItEUR::P Mathematics and Science
Online Erişim:	https://directory.doabooks.org/handle/20.500.12854/176901.4
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!