16
submitted 8 months ago by velox_vulnus@lemmy.ml to c/hardware@lemmy.ml

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?

you are viewing a single comment's thread
view the rest of the comments
[-] victoitor@lemmy.eco.br 2 points 8 months ago

Would a quantum computer count as a finite state machine? If not, wouldn't it be an example of something different?

[-] SinAdjetivos@beehaw.org 1 points 8 months ago

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.

this post was submitted on 22 Jan 2024
16 points (90.0% liked)

Hardware

4941 readers
44 users here now

This is a community dedicated to the hardware aspect of technology, from PC parts, to gadgets, to servers, to industrial control equipment, to semiconductors.

Rules:

founded 4 years ago
MODERATORS