So far, I’ve come across these three terms:
- Princeton (John von Neumann) architecture
- Harvard architecture
- Modified Harvard architecture
Is that it? What about some of the other alternatives?
So far, I’ve come across these three terms:
Is that it? What about some of the other alternatives?
Would a quantum computer count as a finite state machine? If not, wouldn’t it be an example of something different?
Tbh a little bit outside my wheelhouse but Lance Fortnow had a proof showing that all the implementations of quantum computing could be modelled using a Quantum Turing machine and are more complex forms of probabalistic automata. It’s technically not, because a finite state machine can also be called a deterministic finite automata where a probabalistic automata is a Nondeterministic finite automata.
So no… But also mostly the same principle just with fuzzy logic.