Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 622 Reviews about "Computation By Abstract Devices (F.1)": Date Reviewed   A quantum computation workbook Choi M., Springer International Publishing, Cham, Switzerland, 2022. 446 pp.  Type: Book (978-3-030912-13-0) Quantum computing is a complex and highly interdisciplinary field that assumes deep knowledge of particle physics, quantum mechanics theory, mathematics, and information theory, to name the most important disciplines outside the also essential fie... Jan 30 2023   Cognition and intractability: a guide to classical and parameterized complexity analysis van Rooij I., Blokpoel M., Kwisthout J., Wareham T., Cambridge University Press, New York, NY, 2019. 374 pp.  Type: Book (978-1-108728-97-3) Is thinking computable--not just in principle, but in practice? In the past this was the subject of vigorous exchanges between philosophers [1,2,3]; today, with the promise of artificial intelligence (AI) appearing ever bright... Jun 15 2021   Quantum relational Hoare logic Unruh D. Proceedings of the ACM on Programming Languages 3(POPL): 1-31, 2019.  Type: Article All programs need to be verified--even post-quantum cryptography software. To prove properties of such protocols requires proofs that involve not only quantum programming, but also pairs of programs, an encryptor and an attack... Jan 22 2021   Finite-state techniques: automata, transducers and bimachines Mihov S., Schulz K., Cambridge University Press, New York, NY, 2019. 324 pp.  Type: Book (978-1-108485-41-8) The mathematical theory of automata is one of the great ideas of computer science, easy to state and understand, yet with great explanatory power and potential for problem solving.... Oct 5 2020   Interconnectability of session-based logical processes Toninho B., Yoshida N. ACM Transactions on Programming Languages and Systems 40(4): 1-42, 2018.  Type: Article The analysis of communication network processes is an important topic in computer science. This paper compares two formalisms for describing such networks, namely linear logic (originally derived from an investigation into the fine str... May 6 2019   Regular language representations in the constructive type theory of Coq Doczkal C., Smolka G. Journal of Automated Reasoning 61(1-4): 521-553, 2018.  Type: Article Theoretical computer science is traditionally presented using paper and pencil, with little emphasis on formal correctness and completeness in detail. This provides a backdoor for ambiguities, gaps, and errors. However, nowadays, power... Aug 16 2018   Models of computation Bruni R., Montanari U., Springer Publishing Company, Incorporated, New York, NY, 2017. 395 pp.  Type: Book (978-3-319428-98-7) Any formal definition of a language has to clearly specify its syntax (a grammatical specification that in some way fixes the structure of well-formed statements) and semantics (the manner in which meaning is assigned to well-formed st... Jul 13 2018   On the uniform computational content of computability theory Brattka V., Hendtlass M., Kreuzer A. Theory of Computing Systems 61(4): 1376-1426, 2017.  Type: Article Weihrauch reducibility (≤W) is a type of reducibility relation that can be used to classify the uniform computational content of various mathematical objects. It is first defined for multivalued functions between s... Jun 26 2018   Conditioning in probabilistic programming Olmedo F., Gretz F., Jansen N., Kaminski B., Katoen J., Mciver A. ACM Transactions on Programming Languages and Systems 40(1): 1-50, 2018.  Type: Article Machine learning, possibly contrary to popular belief, is not just about endless variations of neural networks. There is also a thriving subculture of probabilistic programming based on Bayesian principles. A large advantage of the lat... Jun 13 2018   Languages with membership determined by single letter factors Higgins P., Alwan S. Theoretical Computer Science 680 15-24, 2017.  Type: Article This paper continues a previous one [1] by the authors, Higgins and Alwan, expanding on the notion of scan languages that require a word to be read completely before determining whether the word belongs to the language. This applies to... Mar 8 2018       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy