E-Book, Englisch, 252 Seiten, eBook
From Categorical Computability to Computable Categories
E-Book, Englisch, 252 Seiten, eBook
Reihe: Theory and Applications of Computability
ISBN: 978-3-031-34827-3
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
In this unique textbook/reference, programs are drawn as string diagrams in the language of categories, which display a universal syntax of mathematics (Computer scientists use them to analyze the program semantics; programmers to display the syntax of computations). Here, the string-diagrammatic depictions of computations are construed as programs in a single-instruction programming language. Such
programs as diagrams
show how functions are packed in boxes and tied by strings. Readers familiar with categories will learn about the foundations of computability; readers familiar with computability gain access to category theory. Additionally, readers familiar with both are offered many opportunities to improve the approach.
Topics and features:Delivers a ‘crash’ diagram-based course in theory of computationUses single-instruction diagrammatic programming languageOffers a practical introduction into categories and string diagrams as computational toolsReveals how computability is programmability, rather than an ‘ether’ permeating computers Provides a categorical model of intensional computation is unique up to isomorphismServes as a stepping stone into research of computable categoriesIn addition to its early chapters introducing computability for beginners, this flexible textbook/resource also contains both middle chapters that expand for suitability to a graduate course as well as final chapters opening up new research. Dusko Pavlovic
is a professor at the Department of Information and Computer Sciences at the University of Hawaii at Manoa, and by courtesy at the Department of Mathematics and the College of Engineering. He completed this book as an Excellence Professor at Radboud University in Nijmegen, The Netherlands.
Zielgruppe
Upper undergraduate
Autoren/Hrsg.
Weitere Infos & Material
1. Drawing Types and Functions.- 2. Monoidal Computer: Computability as a Structure.- 3. Fixpoints.- 4. What can be Computed.- 5. What cannot be Computed.- 6. Computing Programs.- 7. Program-Closed Categories: Computability as a Property.- 8. Computable Categories and Effective Categorical Operations.