Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Computability Theory (F.1.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 19 Reviews about "Computability Theory (F.1.1...)": Date Reviewed   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    The incomputable: journeys beyond the Turing barrier Cooper S., Soskova M., Springer International Publishing, New York, NY, 2017. 292 pp.  Type: Book (978-3-319436-67-8) Computer science is composed of two major areas. One is strongly related to engineering: the architecture and design of computing systems and the development of tools to employ such systems. The other is more related to scientific inqu... Mar 7 2018   Limits of computation: from a programming perspective Reus B., Springer International Publishing, New York, NY, 2016. 348 pp.  Type: Book (978-3-319278-87-2) In the early 1990s, a chance encounter with Douglas Hofstadter’s book Godel, Escher, Bach [1], an eclectic synthesis of philosophy, physics, and (dare I say it) computer science, left me intrigued about concepts of dec... Jan 4 2017   The foundations of computability theory Robic B., Springer Publishing Company, Incorporated, New York, NY, 2015. 331 pp.  Type: Book (978-3-662448-07-6) This book serves as an introduction to computability for readers who are somewhat familiar with mathematics and logic. The brief appendix of notions and notations is useful, but does not provide standalone orientation. For the prepared... Apr 19 2016   Geospatial abduction: principles and practice Shakarian P., Subrahmanian V., Springer Publishing Company, Incorporated, New York, NY, 2012. 184 pp.  Type: Book (978-1-461417-93-4) Information about the geographic distribution of economic activity, health statistics, and similar matters of human interest has long been of great value to governments, commercial concerns, and political entities and organizations. Mu... Jun 13 2012   Concrete digital computation: What does it take for a physical system to compute? Fresco N. Journal of Logic, Language and Information 20(4): 513-537, 2011.  Type: Article The many accounts of digital computation “establish different (but not all irreducibly different) requirements for a physical system.” This paper addresses the physical meaning of digital computation. Instead of off... Jan 6 2012   Weakly useful sequences Fenner S., Lutz J., Mayordomo E., Reardon P. Information and Computation 197(1/2): 41-54, 2005.  Type: Article An infinite binary sequence x is defined to be strongly useful if there exists a recursive function t, such that for every decidable sequence y there exists a Turing machine usin... Nov 3 2005   Hundreds of impossibility results for distributed computing Fich F., Ruppert E. Distributed Computing 16(2-3): 121-163, 2003.  Type: Article This extensive survey begins with a concise overview of models, problems, and proof techniques for distributed computing, which establishes a common nomenclature used throughout the work. It proceeds with the illustration of known unso... Jun 10 2004   A topological characterization of random sequences Calude C., Marcus S., Staiger L. Information Processing Letters 88(5): 245-250, 2003.  Type: Article Random sequences within the framework of algorithmic information theory are discussed in this paper. (An excellent introduction to the area was written by Calude [1].) Specifically, the paper studies the set of random sequences from a ... Mar 4 2004   Computability theory Cooper B., CRC Press, Inc., Boca Raton, FL, 2002.  Type: Book (9781584882374) Computability theory is often included in studies of automata and formal languages, or of recursion theory. These topics, which originated with the work of some remarkable mathematicians (Gödel, Church, Turing, and Post) were ... Mar 4 2004       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy