Discrete Structures, Logic, and Computability
- ISBN-10
- 0867204672
- ISBN-13
- 9780867204674
- Series
- Discrete Structures, Logic, and Computability
- Category
- Computable functions
- Pages
- 866
- Language
- English
- Published
- 1994
- Publisher
- Jones & Bartlett Publishers
- Author
- James L. Hein
Get the book
Other editions
-
- 2015-12-11
- 1040 pages
- Paperback
- Jones & Bartlett Publishers
-
- 2010-10-25
- 1009 pages
- Ebook
- Jones & Bartlett Publishers
Similar books
-
Effective Mathematics of the Uncountable
By Russell Miller, Noam Greenberg, Denis Roman HirschfeldtThis book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages.
-
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
By Karen Lange, Denis R. Hirschfeldt, Richard A. Shore... Fabrizio Colombo, Irene Sabadini, Daniele C. Struppa, and Jeff Tollaksen, The Mathematics of Superoscillations, 2017 C. L. Fefferman, J. P. Lee-Thorp, and M. I. Weinstein, Topologically Protected States in One-Dimensional Systems, ...
-
Introduction to Formal Languages, Automata Theory and Computation
By Kamala KrithivasanThe book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology.
-
Introduction to Languages and the Theory of Computation
By John C. MartinA distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used.
-
Computability Theory: An Introduction to Recursion Theory
By Herbert B. EndertonThis presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. aThe text includes both the standard material for a first course in ...
-
Computability: Computable Functions, Logic, and the Foundations of Mathematics
By Richard L. EpsteinComputability: Computable Functions, Logic, and the Foundations of Mathematics
-
An Early History of Recursive Functions and Computability: From Gödel to Turing
By Rod AdamsTraces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications
-
Automata, Computability and Complexity: Theory and Applications
By Elaine RichAutomata, Computability and Complexity: Theory and Applications