Complexity, Logic, and Recursion Theory (ePub)
(Sprache: Englisch)
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
sofort als Download lieferbar
eBook (ePub)
332.10 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Complexity, Logic, and Recursion Theory (ePub)“
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
Autoren-Porträt von Andrea Sorbi
Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.
Bibliographische Angaben
- Autor: Andrea Sorbi
- 2019, 1. Auflage, 380 Seiten, Englisch
- Verlag: Taylor & Francis
- ISBN-10: 0429529953
- ISBN-13: 9780429529955
- Erscheinungsdatum: 07.05.2019
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: ePub
- Größe: 19 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Complexity, Logic, and Recursion Theory"
Schreiben Sie einen Kommentar zu "Complexity, Logic, and Recursion Theory".
Kommentar verfassen