History


Help on query formulation
first | previous | 1 | next | last

Result 1 to 6 of 6 total

Mathematical foundations for computer science. Sets, logic, recursion. (Mathematische Grundlagen für die Informatik. Mengen, Logik, Rekursion.) (German)
Springer-Lehrbuch. Wiesbaden: Springer Vieweg (ISBN 978-3-658-03078-0/pbk; 978-3-658-03079-7/ebook). x, 222~p. (2013).
Classification: E35 E65 P25 Reviewer: Klaus D. Kiermeier (Berlin)
1
Proofs and algorithms. An introduction to logic and computability. (English)
Undergraduate Topics in Computer Science. New York, NY: Springer (ISBN 978-0-85729-120-2/pbk; 978-0-85729-121-9/ebook). xii, 155~p. (2011).
Classification: P25 E35 R45 Reviewer: Damas Gruska (Bratislava)
2
Limits of computability: Discovery and exploratory learning in practice. (Grenzen der Berechenbarkeit: Entdeckendes und forschendes Lernen in der Praxis.) (German)
Log In 31, No. 168, 42-49 (2011).
Classification: P24 Q84
3
Proofs and algorithms. An introduction to logic and computability. (Les démonstrations et les algorithmes. Introduction à la logique et à la calculabilité.) (French)
Palaiseau: Les Éditions de l’École Polytechnique (ISBN 978-2-7302-1569-5). 195~p. (2010).
Classification: P25 E35
4
Theories of computability. (English)
Cambridge: Cambridge University Press. ix, 251 p. (1997).
Classification: P25 E35 Reviewer: U.Schöning (Ulm)
5
What computing is all about. (English)
Texts and Monographs in Computer Science. Berlin: Springer-Verlag. xii, 478 p. DM 78.00; öS 608.40; sFr 78.00 /hc (1993).
Classification: P15 Reviewer: B.Möller (Augsburg)
6
first | previous | 1 | next | last

Result 1 to 6 of 6 total

Valid XHTML 1.0 Transitional Valid CSS!