This question already has an answer here:
- Is C actually Turing-complete? 9 answers
I understand that TM is a 'Model of Computation' which tells us about the computational power of a machine while Von Neumann Architecture is a 'System Architecture' that tells us about how the machine is actually been implemented. Also, I think of 'Programming Paradigms' as how a problem is modelled in a High-Level Language. But I see a lot of conflicts over the connection between these terms all over the internet. Can someone please enlighten me on the below points:
i. In many places, I happen to see phrases like 'Von Neumann Systems are always Turing Complete' and so on. But I am unable to find a reason why a less powerful model of computation - say a DFA could be implemented using Von Neumann Architecture
ii. Imperative Programming Model is called all over the internet as 'Von Neumann Model'. I am totally clueless about this. Why can't we call it 'Howard Model' then?