國立高雄大學圖資館 |

登入

回首頁 到查詢結果 [ subject:"Computational Complexity." ]

Programs as diagramsfrom categorical computability to computable categories /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Programs as diagramsby Dusko Pavlovic.
其他題名:	from categorical computability to computable categories /
作者:	Pavlovic, Dusko.
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	xvii, 252 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Categories (Mathematics)
電子資源:	https://doi.org/10.1007/978-3-031-34827-3
ISBN:	9783031348273$q(electronic bk.)

Programs as diagramsfrom categorical computability to computable categories /
Pavlovic, Dusko.

Programs as diagramsfrom categorical computability to computable categories /[electronic resource] :by Dusko Pavlovic. - Cham :Springer Nature Switzerland :2023. - xvii, 252 p. :ill., digital ;24 cm. - Theory and applications of computability, in cooperation with the association computability in Europe,2190-6203. - Theory and applications of computability, in cooperation with the association computability in Europe..

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.

It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. 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 computation Uses single-instruction diagrammatic programming language Offers a practical introduction into categories and string diagrams as computational tools Reveals how computability is programmability, rather than an 'ether' permeating computers Provides a categorical model of intensional computation is unique up to isomorphism Serves as a stepping stone into research of computable categories In 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.

ISBN: 9783031348273$q(electronic bk.)

Standard No.: 10.1007/978-3-031-34827-3doiSubjects--Topical Terms:

206297
Categories (Mathematics)

LC Class. No.: QA169

Dewey Class. No.: 512.62

Programs as diagramsfrom categorical computability to computable categories /
LDR:03350nmm a2200337 a 4500 001 651128
003 DE-He213
005 20230919114258.0
006 m d
007 cr nn 008maaau
008 240327s2023 sz s 0 eng d
020 $a 9783031348273$q(electronic bk.)
020 $a 9783031348266$q(paper)
024 7 $a 10.1007/978-3-031-34827-3 $2 doi
035 $a 978-3-031-34827-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA169
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 512.62 $2 23
090 $a QA169 $b .P338 2023
100 1 $a Pavlovic, Dusko. $3 510596
245 1 0 $a Programs as diagrams $h [electronic resource] : $b from categorical computability to computable categories / $c by Dusko Pavlovic.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xvii, 252 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability, in cooperation with the association computability in Europe, $x 2190-6203
505 0 $a 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.
520 $a It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. 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 computation Uses single-instruction diagrammatic programming language Offers a practical introduction into categories and string diagrams as computational tools Reveals how computability is programmability, rather than an 'ether' permeating computers Provides a categorical model of intensional computation is unique up to isomorphism Serves as a stepping stone into research of computable categories In 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.
650 0 $a Categories (Mathematics) $3 206297
650 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Computability and Recursion Theory. $3 931679
650 2 4 $a Computational Complexity. $3 913441
650 2 4 $a Programming Language. $3 913494
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Theory and applications of computability, in cooperation with the association computability in Europe. $3 731259
856 4 0 $u https://doi.org/10.1007/978-3-031-34827-3
950 $a Computer Science (SpringerNature-11645)