diff options
| author | Christian Kolset <christian.kolset@gmail.com> | 2025-05-06 16:25:53 -0600 |
|---|---|---|
| committer | Christian Kolset <christian.kolset@gmail.com> | 2025-05-06 16:25:53 -0600 |
| commit | e22e15fd8d9d0511a7cfa8fdb0e75509aeba6a15 (patch) | |
| tree | e3b0872f6eb82a0869992f693c3f3feba92e3afe /admin | |
| parent | 98bd4cee68fb442fbbf5cd06a2e17ef31dd629f5 (diff) | |
Updated tutorials
Diffstat (limited to 'admin')
| -rw-r--r-- | admin/meeting-notes/2025-04-29.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/admin/meeting-notes/2025-04-29.md b/admin/meeting-notes/2025-04-29.md index 990b0c1..6dfeae7 100644 --- a/admin/meeting-notes/2025-04-29.md +++ b/admin/meeting-notes/2025-04-29.md @@ -48,8 +48,8 @@ To do: - Each Tutorial should have two problems (one to work in classroom, one to leave as homework) - Intro to algorithm at the beginning of Module 2 (computational algorithm vs. real-world algorithms) - Move AI at the end of Module 2 -- AI vs. alorithms -- AI types (LLM vs. Resconstructive AI vs. Generative AI, Reinforcement AI, Vision AI etc) +- AI vs. algorithms +- AI types (LLM vs. Reconstructive AI vs. Generative AI, Reinforcement AI, Vision AI etc) - Then we go into AI applications: AI for code debugging vs AI for code generation based on flowcharts - pick a GIT GUI program for next time and see how much we can simplify the discussion on Git and Github - Module 3 - bare minimum numerical methods: 1. Equation solvers/Root finding: Newton, Secant Method. 2. Systems of Equations: Gauss Method, LU Decomposition. 3. Integration: Trapezoid Method, Simpson Method. 4. Differentiation/ODEs: Explicit Euler, RK methods, Implicit Euler.
\ No newline at end of file |