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...

Fuld beskrivelse

Bibliografiske detaljer

Format:	Online
Sprog:	italiensk
Udgivet:	Milano University Press 2026
Fag:	undecidable problems recursively enumerable sets time and space complexity Np-complete problems computable functions thema EDItEUR::P Mathematics and Science
Online adgang:	https://directory.doabooks.org/handle/20.500.12854/176901.2
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!