1 CMSC 28100 Introduction to Complexity Theory
Description: 1 CMSC 28100 Introduction to Complexity Theory Spring 2025 Instructor: William Hoza Which problems can be solved through computation? 2 3 4 5 Which problems can be solved through computation? 6 7 Example 1: Primality testing 8 9 10 11 12 B:
Related Topics
Download Presentation
"1 CMSC 28100 Introduction to Complexity Theory" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
slide1. 1 CMSC 28100 Introduction to Complexity Theory Spring 2025 Instructor: William Hoza<br>
slide2. Which problems can be solved through computation? 2<br>
slide3. 3<br>
slide4. 4<br>
slide5. 5<br>
slide6. Which problems can be solved through computation? 6<br>
slide7. 7<br>
slide8. Example 1: Primality testing 8<br>
slide9. 9<br>
slide10. 10<br>
slide11. 11<br>
slide12. 12 B: False D: It’s not well-defined A: True<br>
slide13. 13<br>
slide14. 14<br>
slide15. Time complexity: Theory vs. practice 15<br>
slide16. Is the Turing machine model a good model? 16<br>
slide17. Multi-tape Turing machines, revisited 17<br>
slide18. 18 1 1 0 0 # 1 $ 0<br>
slide19. 19<br>
slide20. Word RAM model (RAM = Random Access Machine) 20 +, -, *, /, %, ==, <, >, &&, ||, &, |, ^, <<, >> (The details are not completely standardized. This is just one reasonable version of the model)<br>
slide21. Word RAM model 21<br>
slide22. Word RAM model 22<br>
slide23. Word RAM model 23 The version of the word RAM model described here is based on the lecture notes for CS 1200 at Harvard: https://harvard-cs-1200.github.io/cs1200/<br>
slide24. Word RAM model 24 The version of the word RAM model described here is based on the lecture notes for CS 1200 at Harvard: https://harvard-cs-1200.github.io/cs1200/<br>
slide25. Word RAM model Word RAM time complexity closely matches time complexity “in practice” on ordinary computers
Some version of the word RAM model is typically assumed (implicitly or explicitly) in algorithms courses and the computing industry 25<br>
slide26. 26<br>
slide2. Which problems can be solved through computation? 2<br>
slide3. 3<br>
slide4. 4<br>
slide5. 5<br>
slide6. Which problems can be solved through computation? 6<br>
slide7. 7<br>
slide8. Example 1: Primality testing 8<br>
slide9. 9<br>
slide10. 10<br>
slide11. 11<br>
slide12. 12 B: False D: It’s not well-defined A: True<br>
slide13. 13<br>
slide14. 14<br>
slide15. Time complexity: Theory vs. practice 15<br>
slide16. Is the Turing machine model a good model? 16<br>
slide17. Multi-tape Turing machines, revisited 17<br>
slide18. 18 1 1 0 0 # 1 $ 0<br>
slide19. 19<br>
slide20. Word RAM model (RAM = Random Access Machine) 20 +, -, *, /, %, ==, <, >, &&, ||, &, |, ^, <<, >> (The details are not completely standardized. This is just one reasonable version of the model)<br>
slide21. Word RAM model 21<br>
slide22. Word RAM model 22<br>
slide23. Word RAM model 23 The version of the word RAM model described here is based on the lecture notes for CS 1200 at Harvard: https://harvard-cs-1200.github.io/cs1200/<br>
slide24. Word RAM model 24 The version of the word RAM model described here is based on the lecture notes for CS 1200 at Harvard: https://harvard-cs-1200.github.io/cs1200/<br>
slide25. Word RAM model Word RAM time complexity closely matches time complexity “in practice” on ordinary computers
Some version of the word RAM model is typically assumed (implicitly or explicitly) in algorithms courses and the computing industry 25<br>
slide26. 26<br>