Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Computability Theory (F.4.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 24 Reviews about "Computability Theory (F.4.1...)": Date Reviewed   Simple type theory: a practical logic for expressing and reasoning about mathematical ideas Farmer W., BIRKHAUSER, Basel, Switzerland, 2023. 312 pp.  Type: Book (3031211138) The book is an introduction to one of the dialects of type theory. All type theories are grounded in logic. The promise of simple type theory is that it can be understood and handled much easier than other versions of type theory, for example, dep... Sep 19 2023   Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency Büning H., Zhao X. Information Processing Letters 84(3): 147-151, 2022.  Type: Article Büning and Zhao introduce a way to compute a representation of propositional formulas, which they call “minimal unsatisfiable.” They call a formula in conjunctive normal form (CNF) minimal unsatisfiable if ... Feb 8 2005   Computability on subsets of metric spaces Brattka V., Presser G. Theoretical Computer Science 305(1-3): 43-76, 2003.  Type: Article When I was a graduate student many years ago, I attended a lecture where a professor of mathematics was discussing some esoteric extension of theorem A to some much more abstract situation B. One of my fellow students muttered, ... Jan 5 2004   The discrepancy method: randomness and complexity Chazelle B. (ed), Cambridge University Press, New York, NY, 2000. 463 pp.  Type: Book (9780521770934) According to the preface, discrepancy theory asks how uniform a sequence of numbers can be. In more detail, it asks how fast, for a sequence {Xi}, the function D(n) = sup{|{i | Xi ≤ X & i ≤ n}| - ... Oct 3 2002   Relatively computable functions of real variables Zhou Q. Computing 67(2): 167-181, 2001.  Type: Article Beginning with Grzegorczyk’s important concepts of hierarchies of recursive functions, computable functionals, and computable real-valued continuous functions [1], the author gives a well-written and comprehensive exposition... Jul 19 2002   Computability and complexity theory Homer S., Selman A., Springer-Verlag New York, Inc., New York, NY, 2001. 194 pp.  Type: Book (9780387950556) The difference between this new introductory graduate textbook in theoretical computer science and other texts is that the authors have chosen to concentrate on computability theory and computational complexity theory. They motivate th... Jul 1 2001   Recursion theory Shoenfield J., A. K. Peters, Ltd., Natick, MA, 2001. 96 pp.  Type: Book (9781568811499) Here is a photographic reprint of a classic work originally published in 1993. Sadly, the author died (on November 15, 2000) while the book was being reprinted. Many will recall that he was Professor Emeritus of mathematics at Duke Uni... Apr 1 2001   Computability (2nd ed.): computable functions, logic, and the foundations of mathematics Epstein R., Carnielli W., Wadsworth Publ. Co., Belmont, CA, 2000. 337 pp.  Type: Book (9780534546441) The authors introduce computability theory from a philosophical perspective (after all, the theory was developed before there were any computers). From a purely mathematical point of view, there is not much remarkable about the treatme... Jul 1 2000   A domain-theoretic approach to computability on the real line Edalat A., Sünderhauf P. Theoretical Computer Science 210(1): 73-98, 1999.  Type: Article Notions of computability for real functions (and functions betweenPolish spaces) have been studied since the 1950s, using two differentapproaches. The first considers computable real functions on all realnumbers (the variant of this ap... Jul 1 1999   Some undecidability results concerning the property of preserving regularity Otto F. Theoretical Computer Science 207(1): 43-72, 1998.  Type: Article Otto considers regularity-preserving properties of string- and term-rewriting systems. The main result is that regularity is preserved by string-rewriting systems (SRSs) when the underlying alphabet is extended by adding letters which,... May 1 1999       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy