Sari: Cambridge Tracts in Theoretical Computer Science
(Ilmumisaeg: 06-Feb-2025, Hardback, Kirjastus: Cambridge University Press, ISBN-13: 9781108835466)
Providing an in-depth treatment of an exciting research area, this texts central topics are initial algebras and terminal coalgebras, primary objects of study in all areas of theoretical computer science connected to semantics. It contains a thoroug...Loe edasi...
We define higher quantum Airy structures as generalizations of the KontsevichSoibelman quantum Airy structures by allowing differential operators of arbitrary order (instead of only quadratic). We construct many classes of examples of higher quantum...Loe edasi...
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without...Loe edasi...
(Ilmumisaeg: 07-Mar-2024, Hardback, Kirjastus: Cambridge University Press, ISBN-13: 9781009302142)
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without...Loe edasi...
Noam Greenberg, Sanjay Jain, Keng Meng Ng, Sven Schewe, Frank Stephan, Guohua Wu, Yue Yang
Sari: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore
(Ilmumisaeg: 15-Nov-2023, Hardback, Kirjastus: World Scientific Publishing Co Pte Ltd, ISBN-13: 9789811278624)
This volume results from two programs that took place at the Institute for Mathematical Sciences at the National University of Singapore: Aspects of Computation in Celebration of the Research Work of Professor Rod Downey (21 August to 15 September...Loe edasi...
Recursion is considered to be an “advanced” topic. It shouldn’t be. While this little volume covers a number of advanced topics that involve recursion - tail recursion, pruning, recursive data structures, the use of accumulators, and backtracking - t...Loe edasi...
Recursion is considered to be an “advanced” topic. It shouldn’t be. While this little volume covers a number of advanced topics that involve recursion - tail recursion, pruning, recursive data structures, the use of accumulators, and backtracking - t...Loe edasi...
An accessible yet rigorous crash course on recursive programming using Python and JavaScript examples.Recursion has an intimidating reputation: it’s considered to be an advanced computer science topic frequently brought up in coding in...Loe edasi...
Mustafa offers a thorough account of probabilistic, combinatorial, and geometric sampling methods and their combinatorial and algorithmic applications. He also revisits classical results but with new and more elegant proofs. Readers need a basic...Loe edasi...
Considering how minimal weak truth table degrees interact with computably enumerable Turing degrees, Downey, Ng, and Solomon obtain three main results. First, there are sets with minimal weak truth table degree that bound noncomputable computably...Loe edasi...
Explores two important phenomena in natural language - recursion and embedding - integrating current linguistic theory, cross-linguistic fieldwork, and specific acquisition and experimental techniques....Loe edasi...
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...Loe edasi...
(Ilmumisaeg: 06-Dec-2018, Hardback, Kirjastus: Cambridge University Press, ISBN-13: 9781108415583)
The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It in...Loe edasi...
Drawing from the lecture notes for a semester-long program for advanced undergraduate students, Katz and Reimann introduce Ramsey theory. The material should be accessible to anyone who has completed a first set of proof-based mathematics courses...Loe edasi...
Luiz Amaral, Marcus Maia, Andrew Nevins, Tom Roeper
(Ilmumisaeg: 07-Jun-2018, Hardback, Kirjastus: Cambridge University Press, ISBN-13: 9781108418065)
An exploration of two important phenomena in natural language - recursion and embedding - that looks in particular at the cognitive skills we must possess in order to manipulate language. Integrating cross disciplinary methodologies, it will be of im...Loe edasi...
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical an...Loe edasi...
(Ilmumisaeg: 03-Aug-2017, Hardback, Kirjastus: Oxford University Press, ISBN-13: 9780198785156)
This book provides a comprehensive account of the role of recursion in language in two distinct but interconnected ways. First, David J. Lobina examines how recursion applies at different levels within a full description of natural language. Specific...Loe edasi...
