Download presentation
Presentation is loading. Please wait.
1
Achieving Turing Completeness
LMC Branching Achieving Turing Completeness
2
Turing Completeness Requirements of a "universal" programming language
Ability to manipulate symbols (add numbers, do logic) Ability to read/store arbitrary number of values in memory Ability to skip ahead or back in instructions
3
Branch Branch instructions jump to new location Change PC to XX
4
Branch Branch instructions jump to new location Change PC to XX
5
Branch Conditional branch only jumps if Accumulator has a certain value
6
Branch Conditional branch only jumps if Accumulator has a certain value
7
Loops A branch that goes backwards can make a loop to repeat instructions
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.