Daftar Isi
1. CS 373: P vs NP, and Why Is It Called NP
Notes here: ursinus-
2. CS 373 Theory of Computation: DFA Binary Divisibility by 3
Notes here: ursinus-
3. CS-373 Unit 1 One-dimensional localization
One-dimensional localization with histogram filter (Udacity's
4. CS 373: Substring DFAs Explanation
Homework here: ursinus-
5. CS 373: A Formal Definition of Big-O
Notes at these links: ...
6. CS 373 Final Presentation Submission - Spectre Exploits
Deep dive into the Spectre attacks including a demo and some.
7. CS-373 Unit 5 PID controller and twiddle algorithm (final run)
Motion control with PID-controller and Twiddle algorithm to find PID parameters (
8. CS 373: The Class NP (Certificates and Polynomial Time Verifiers)
Notes here: ursinus-
9. Coconuts 1 - CS373 Unit 2 - Udacity
Other units in this course below: Unit 1: youtube.com/playlist?list=PL1EF620FCB11312A6 Unit 2: ...
10. CS-373 Unit 2 Kalman filter
Speed and position estimation with Kalman filter (Udacity's
11. CS 373: Rice's Theorem for Undecidable Languages over Turing Machines
Notes here: ursinus-
12. CS-373 Unit 3 particle filter
Robot position estimation using particle filter (
13. CS 373: The Class P / Complexity Analysis of Reduction from Multitape To Single Tape Turing Machines
Notes here: github.com/ursinus-
14. CS 373 Phishing Attacks Final Presentation by Jessi Frenzel
This was my final presentation for
15. CS 373: Undecidable Problems (Halt, ETM, RegTM, TwoWriteTM) And Reductions from ATM
Notes here: ursinus-
Cs 373 Information Guide
Background to Cs 373
Main Features
Developments
Detailed Analysis
Data is compiled from public records and verified media reports.
Last Updated: August 11, 2026
Final Thoughts
Disclaimer: Disclaimer: All information is compiled from publicly available data, media reports, and analysis. Actual details may vary.