• 0 Posts
  • 5 Comments
Joined 1 year ago
cake
Cake day: June 13th, 2023

help-circle



  • 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.


  • Depends how far you stretch the definition. Those listed are a subset of RASP machine models, which are a subset of turing machines, which is a subset of finite state machines, but as far as “general purpose computing architectures” that’s about it as far as I’m aware… Unless you get into weird application specific stuff like differentiable neural computers.

    You could also go the other way and look at how the basic principles of those architectures get expanded on IE Von Neumann -> ARM -> Advanced Microcontroller Bus Architecture (AMBA) -> Advanced eXtensible Interface (AXI) -> etc.