Digital Commons @ IWU
metadata only
Fall 2016 CS 357 Sect. 1 Models of Computing
Models of Computing (W) Theoretical foundations of computing. Automata, grammars, decidability and complexity. Computability and logic: undecidability and incompletesness. Automata theoretic approaches to decision problems in logic. Prerequisite: CS 255 or CS/Math/Phil 360. Offered each spring.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computation Structures#67182
- Computation Structures#3465
- On the Foundations of Computing. Computing as the Fourth Great Domain of Science#718411
- Theory of Finite Automata: With an Introduction to Formal Languages#708296
- On the Relation of Computing to the World#82164
Record · ID 1411228
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive