東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Theory of Computation." ]

切換: 標籤 | MARC模式 | ISBD

Understanding computation = pillars,...

Rosenberg, Arnold L.

FindBook

Google Book

Amazon

博客來

Understanding computation = pillars, paradigms, principles /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Understanding computation/ by Arnold L. Rosenberg, Lenwood S. Heath.
其他題名:	pillars, paradigms, principles /
作者:	Rosenberg, Arnold L.
其他作者:	Heath, Lenwood S.
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xvii, 570 p. :ill., digital ;24 cm.
內容註:	Preface -- I: Introduction -- 1 Introducing Computation Theory -- 2 Introducing the Book -- II: Pillar S: STATE -- 3 Pure State-Based Computational Models -- 4 The Myhill-Nerode Theorem: Implications and Applications -- 5 Online Turing Machines and the Implications of Online Computing -- 6 Pumping: Computational Pigeonholes in Finitary Systems -- 7 Mobility in Computing: An FA Navigates a Mesh -- 8 The Power of Cooperation: Teams of MFAs on a Mesh -- III: Pillar E: ENCODING -- 9 Countability and Uncountability: The Precursors of ENCODING -- 10 Computability Theory -- 11 A Church-Turing Zoo of Computational Models -- 12 Pairing Functions as Encoding Mechanisms -- IV: Pillar N: NONDETERMINISM -- 13 Nondeterminism as Unbounded Parallelism -- 14 Nondeterministic Finite Automata -- 15 Nondeterminism as Unbounded Search -- 16 Complexity Theory -- V: Pillar P: PRESENTATION/SPECIFICATION -- 17 The Elements of Formal Language Theory -- A A Chapter-Long Text on Discrete Mathematics -- B Selected Exercises, by Chapter -- List of ACRONYMS and SYMBOLS -- References -- Index.
Contained By:	Springer Nature eBook
標題:	Computational complexity. -
電子資源:	https://doi.org/10.1007/978-3-031-10055-0
ISBN:	9783031100550

Understanding computation = pillars, paradigms, principles /
Rosenberg, Arnold L.

Understanding computationpillars, paradigms, principles /[electronic resource] :by Arnold L. Rosenberg, Lenwood S. Heath. - Cham :Springer International Publishing :2022. - xvii, 570 p. :ill., digital ;24 cm. - Texts in computer science,1868-095X. - Texts in computer science..

Preface -- I: Introduction -- 1 Introducing Computation Theory -- 2 Introducing the Book -- II: Pillar S: STATE -- 3 Pure State-Based Computational Models -- 4 The Myhill-Nerode Theorem: Implications and Applications -- 5 Online Turing Machines and the Implications of Online Computing -- 6 Pumping: Computational Pigeonholes in Finitary Systems -- 7 Mobility in Computing: An FA Navigates a Mesh -- 8 The Power of Cooperation: Teams of MFAs on a Mesh -- III: Pillar E: ENCODING -- 9 Countability and Uncountability: The Precursors of ENCODING -- 10 Computability Theory -- 11 A Church-Turing Zoo of Computational Models -- 12 Pairing Functions as Encoding Mechanisms -- IV: Pillar N: NONDETERMINISM -- 13 Nondeterminism as Unbounded Parallelism -- 14 Nondeterministic Finite Automata -- 15 Nondeterminism as Unbounded Search -- 16 Complexity Theory -- V: Pillar P: PRESENTATION/SPECIFICATION -- 17 The Elements of Formal Language Theory -- A A Chapter-Long Text on Discrete Mathematics -- B Selected Exercises, by Chapter -- List of ACRONYMS and SYMBOLS -- References -- Index.

Computation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? How does one reason about such questions? This unique textbook strives to endow students with conceptual and manipulative tools necessary to make computation theory part of their professional lives. The work achieves this goal by means of three stratagems that set its approach apart from most other texts on the subject. For starters, it develops the necessary mathematical concepts and tools from the concepts' simplest instances, thereby helping students gain operational control over the required mathematics. Secondly, it organizes development of theory around four "pillars," enabling students to see computational topics that have the same intellectual origins in physical proximity to one another. Finally, the text illustrates the "big ideas" that computation theory is built upon with applications of these ideas within "practical" domains in mathematics, computer science, computer engineering, and even further afield. Suitable for advanced undergraduate students and beginning graduates, this textbook augments the "classical" models that traditionally support courses on computation theory with novel models inspired by "real, modern" computational topics,such as crowd-sourced computing, mobile computing, robotic path planning, and volunteer computing. Arnold L. Rosenberg is Distinguished Univ. Professor Emeritus at University of Massachusetts, Amherst, USA. Lenwood S. Heath is Professor at Virgina Tech, Blacksburg, USA.

ISBN: 9783031100550

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

523870
Computational complexity.

LC Class. No.: QA267.7 / .R67 2022

Dewey Class. No.: 511.3

Understanding computation = pillars, paradigms, principles /
LDR:03902nmm a2200325 a 4500 001 2303059
003 DE-He213
005 20220809143013.0
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031100550 $q (electronic bk.)
020 $a 9783031100543 $q (paper)
024 7 $a 10.1007/978-3-031-10055-0 $2 doi
035 $a 978-3-031-10055-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7 $b .R67 2022
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA267.7 $b .R813 2022
100 1 $a Rosenberg, Arnold L. $3 1066857
245 1 0 $a Understanding computation $h [electronic resource] : $b pillars, paradigms, principles / $c by Arnold L. Rosenberg, Lenwood S. Heath.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xvii, 570 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts in computer science, $x 1868-095X
505 0 $a Preface -- I: Introduction -- 1 Introducing Computation Theory -- 2 Introducing the Book -- II: Pillar S: STATE -- 3 Pure State-Based Computational Models -- 4 The Myhill-Nerode Theorem: Implications and Applications -- 5 Online Turing Machines and the Implications of Online Computing -- 6 Pumping: Computational Pigeonholes in Finitary Systems -- 7 Mobility in Computing: An FA Navigates a Mesh -- 8 The Power of Cooperation: Teams of MFAs on a Mesh -- III: Pillar E: ENCODING -- 9 Countability and Uncountability: The Precursors of ENCODING -- 10 Computability Theory -- 11 A Church-Turing Zoo of Computational Models -- 12 Pairing Functions as Encoding Mechanisms -- IV: Pillar N: NONDETERMINISM -- 13 Nondeterminism as Unbounded Parallelism -- 14 Nondeterministic Finite Automata -- 15 Nondeterminism as Unbounded Search -- 16 Complexity Theory -- V: Pillar P: PRESENTATION/SPECIFICATION -- 17 The Elements of Formal Language Theory -- A A Chapter-Long Text on Discrete Mathematics -- B Selected Exercises, by Chapter -- List of ACRONYMS and SYMBOLS -- References -- Index.
520 $a Computation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? How does one reason about such questions? This unique textbook strives to endow students with conceptual and manipulative tools necessary to make computation theory part of their professional lives. The work achieves this goal by means of three stratagems that set its approach apart from most other texts on the subject. For starters, it develops the necessary mathematical concepts and tools from the concepts' simplest instances, thereby helping students gain operational control over the required mathematics. Secondly, it organizes development of theory around four "pillars," enabling students to see computational topics that have the same intellectual origins in physical proximity to one another. Finally, the text illustrates the "big ideas" that computation theory is built upon with applications of these ideas within "practical" domains in mathematics, computer science, computer engineering, and even further afield. Suitable for advanced undergraduate students and beginning graduates, this textbook augments the "classical" models that traditionally support courses on computation theory with novel models inspired by "real, modern" computational topics,such as crowd-sourced computing, mobile computing, robotic path planning, and volunteer computing. Arnold L. Rosenberg is Distinguished Univ. Professor Emeritus at University of Massachusetts, Amherst, USA. Lenwood S. Heath is Professor at Virgina Tech, Blacksburg, USA.
650 0 $a Computational complexity. $3 523870
650 1 4 $a Theory of Computation. $3 892514
700 1 $a Heath, Lenwood S. $3 1073026
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Texts in computer science. $3 1567573
856 4 0 $u https://doi.org/10.1007/978-3-031-10055-0
950 $a Computer Science (SpringerNature-11645)