*Expanding Codd’s Theorem and Tuple Relational Calculus: Topics in Computability, First Order Logic, Turning Completeness, and Computational Complexity* is a reference source book of both the foundations of the relational model and the domains of theoretical computer science required for the coming evolution in database theory. With almost two decades of relational database experience, editor William Mitchell brings together the topics of study underpinning the core of Codd’s Relational Model, and a waterfront of topics brought to bear on extending that model, including Relational Algebra, Relational Calculus, First Order Logic, Computability Theory, Computational Complexity Theory, Turning Completeness, and Quantum Computing.

Purchase a copy of *Expanding Codd’s Theorem* in paperback or hardcover editions.

### Product Details

- Language: English
- Pages: 322
- Binding: Perfect-bound Paperback (also Hardcover edition)
- Interior Ink: Black & white
- Weight: 2.1 lbs.
- Dimensions (inches): 8.5 wide x 11 tall

*Expanding Codd’s Theorem and Tuple Relational Calculus: Topics in Computability, First Order Logic, Turning Completeness, and Computational Complexity* is a reference book collecting relevant topics:

Codd’s theorem – Relational model

Codd’s 12 rules – The Third Manifesto

Three-valued logic – Relational database

Relational algebra – Relational calculus

Set theory – Analytic number theory

Algebraic number theory – Probabilistic number theory

Computational number theory – Tuple

Tuple relational calculus – First-order logic

Domain relational calculus – Computability

Computability theory – Theory of computation

m-recursive function – Lambda calculus

Linear programming – Automata theory

Hypercomputation – Information theory

Algorithmic information theory – Entropy (information theory)

Machine learning – Theoretical computer science

Churchâ€“Turing thesis – Computational complexity theory

Halting problem – Time complexity

P (complexity) – NP (complexity)

ZPP (complexity) – RP (complexity)

BPP (complexity) – BQP

Pseudo-polynomial time – NP-complete

Turing completeness – Non-deterministic Turing machine

Holographic data storage – Optical computing

Internet of Things – Ambient intelligence

Quantum computing – Quantum complexity theory

Quantum Turing machine – Edgar F. Codd

Purchase a copy of *Expanding Codd’s Theorem* in paperback or hardcover editions.