this post was submitted on 22 Jan 2024
16 points (90.0% liked)
Hardware
4941 readers
4 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:
- Posts must be relevant to electronic hardware
- No NSFW content
- No hate speech, bigotry, etc
founded 4 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
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.