Digital Commons @ IWU
metadata only
Spring 2018 CS 357 Sect. 1 Models of Computing
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 128 amd CS/MATH 135. Offered every year.
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
- Spring 2017 CS 355 Sect. 1 Programming Languages#1411227
- Synthesizing Behavioural Models of CPS Using Automata Learning and Statistical Machine Learning#441884
- Algorithmic Government: Automating Public Services and Supporting Civil Servants in using Data Science Technologies#335752
- Overview and Roadmap of Team Automata#1122908
- Natural Possibility Paper 1 Foundations#71154
Record · ID 1411243
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