When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
From MaRDI portal
Publication:2963950
Cites work
- scientific article; zbMATH DE number 2127501 (Why is no real title available?)
- scientific article; zbMATH DE number 4203668 (Why is no real title available?)
- scientific article; zbMATH DE number 3291106 (Why is no real title available?)
- A constructive approach to the problem of program correctness
- A note on the Entscheidungsproblem
- A set of postulates for the foundation of logic. II
- An Unsolvable Problem of Elementary Number Theory
- An axiomatic basis for computer programming
- An early history of recursive functions and computability from Gödel to Turing
- Computer Science and Its Relation to Mathematics
- Finite combinatory processes—formulation
- Haskell before Haskell: an alternative lesson in practical logics of the ENIAC
- Number crunching vs. number theory: computers and FLT, from Kummer to SWAC (1850--1960), and beyond
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On certain formal properties of grammars
- Recursive functions of symbolic expressions and their computation by machine, Part I
- The science of computing: shaping a discipline
This page was built for publication: When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963950)
