建國科技大學圖書館 |

語系: 繁體中文

說明(常見問題)

圖書館個人資料蒐集告知聲明

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Once upon an algorithm : how stories...

Erwig, Martin

Once upon an algorithm : how stories explain computing

紀錄類型:	書目-語言資料,印刷品 : 單行本
副題名:	how stories explain computing
作者:	ErwigMartin,
出版地:	Cambridge, Mass.
出版者:	MIT Press;
出版年:	c2017
面頁冊數:	xii, 319 p.ill. : 24 cm.;
標題:	Computer algorithms -
附註:	Includes bibliographical references and index
ISBN:	978-0-262-03663-4
內容註:	Machine generated contents note: pt. I ALGORITHMS Computation and Algorithms --- Hansel and Gretel 1.A Path to Understanding Computation 2.Walk the Walk: When Computation Really Happens Representation and Data Structures --- Sherlock Holmes 3.The Mystery of Signs 4.Detective's Notebook: Accessory after the Fact Problem Solving and Its Limitations --- Indiana Jones 5.The Search for the Perfect Data Structure 6.Sorting out Sorting 7.Mission Intractable pt. II LANGUAGES Language and Meaning --- Over the Rainbow 8.The Prism of Language 9.Finding the Right Tone: Sound Meaning Control Structures and Loops --- Groundhog Day 10.Weather, Rinse, Repeat 11.Happy Ending Not Guaranteed Recursion --- Back to the Future 12.A Stitch in Time Computes Fine 13.A Matter of Interpretation Types and Abstraction --- Harry Potter 14.The Magical Type 15.A Bird's Eye View: Abstracting from Details

Once upon an algorithm : how stories explain computing
Erwig, Martin

Once upon an algorithm : how stories explain computing / Martin Erwig - Cambridge, Mass. : MIT Press, c2017. - xii, 319 p. ; ill. ; 24 cm..
Machine generated contents note: pt. I ALGORITHMS.
Includes bibliographical references and index.
ISBN 978-0-262-03663-4
Computer algorithms

Once upon an algorithm : how stories explain computing
LDR:01492cam0 2200205 450 001 379517
005 20171002112012.0
009 a21275975
010 1 $a 978-0-262-03663-4 $b hbk. $d NT837
020 $a us $b 2016053945
100 $a 20180723d2017 m y0engy50 ba
101 0 $a eng
102 $a us
105 $a a a 001yy
200 1 $a Once upon an algorithm $e how stories explain computing $f Martin Erwig
210 $a Cambridge, Mass. $c MIT Press $d c2017
215 1 $a xii, 319 p. $c ill. $d 24 cm.
300 $a Includes bibliographical references and index
327 1 $a Machine generated contents note: pt. I ALGORITHMS $a Computation and Algorithms --- Hansel and Gretel $a 1.A Path to Understanding Computation $a 2.Walk the Walk: When Computation Really Happens $a Representation and Data Structures --- Sherlock Holmes $a 3.The Mystery of Signs $a 4.Detective's Notebook: Accessory after the Fact $a Problem Solving and Its Limitations --- Indiana Jones $a 5.The Search for the Perfect Data Structure $a 6.Sorting out Sorting $a 7.Mission Intractable $a pt. II LANGUAGES $a Language and Meaning --- Over the Rainbow $a 8.The Prism of Language $a 9.Finding the Right Tone: Sound Meaning $a Control Structures and Loops --- Groundhog Day $a 10.Weather, Rinse, Repeat $a 11.Happy Ending Not Guaranteed $a Recursion --- Back to the Future $a 12.A Stitch in Time Computes Fine $a 13.A Matter of Interpretation $a Types and Abstraction --- Harry Potter $a 14.The Magical Type $a 15.A Bird's Eye View: Abstracting from Details
606 $a Computer algorithms $2 lc $3 74360
676 $a 005.1 $v 23
680 $a QA76.9.A43 $b E78 2017
700 1 $a Erwig $b Martin $3 367988