Live briefing
Everything about Counter machine
Abstract machine used in a formal logic and theoretical computer science
In formal logic and theoretical computer science, a counter machine or counter automaton is an abstract machine used to model computation. A counter machine comprises a set of one or more unbounded registers, each of which can hold a single non-negative integer, and a list of arithmetic and control instructions for the machine to follow. It is the most primitive of the four types of register machines. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Counter machineA 5-minute orientation
- Skim a recent paper: A Novel Counter-Rotating AFPM Machine Based on Magnetic-Field Modulation for Underwater Propulsion SystemInfluential work since 2022
- Pick up a classic book: An examination of the precision and constancy of fatigue metersThe most-reprinted book on the subject
- Read the landmark paper: Counter machines and counter languagesCited 148 times
- Go sideways: Random-access machineA closely related topic
- Go sideways: Register machineA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
- Basic features
- Alternative names, alternative models
- Formal definition
- Example: COPY the count from register #2 to #3
- The partial recursive functions: building "convenience instructions" using recursion
- Problems with the counter machine model
- Two-counter machines are Turing equivalent (with a caveat)
- A practical example of calculation by counting
🏆 Landmark papers (most cited)
Counter machines and counter languages
Universality of a reversible two-counter machine
Design and development of a precision machine tool using counter motion mechanisms
Machine Learning Vulnerability Analysis of FPGA-based Ring Oscillator PUFs and Counter Measures
Leveraging blockchain and machine learning to counter DDoS attacks over IoT network
A Novel Counter-Rotating Axial-Flux Hybrid-Excitation Permanent Magnet Machine With Dual-Rotor
Counter Propagation Network Based Extreme Learning Machine
Over-the-Counter Breast Cancer Classification Using Machine Learning and Patient Registration Records
🆕 Influential since 2022
A Novel Counter-Rotating AFPM Machine Based on Magnetic-Field Modulation for Underwater Propulsion System
RETRACTED ARTICLE: Intrusion detection based on machine learning in the internet of things, attacks and counter measures
Machine Learning‐Enhanced Modeling of Calcium Carbonate Nucleation in Porous Media Under Counter‐Diffusion Conditions
A Novel Counter-Rotating Single-Stator Dual- Internal-Rotor Permanent Magnet Machine
Estimating CPI Stacks From Multiplexed Performance Counter Data Using Machine Learning
📚 Books worth reading
- 📕An examination of the precision and constancy of fatigue metersS. I. Nilsson · 1966
- 📕Automatismes ıa séquences et commandes numériquesJean Florine · 1969
- 📕Automatismes à séquences et commandes numériquesJean Florine · 1969
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Random-access machine In computer science, random-access machine (RAM or RA-machine) is a model of computation that describes an abstract machine in the general class of register…
- Register machine In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines, analogous to a Turing machine and thus…
- Random-access stored-program machine In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development…
- Counter-machine model There are many variants of the counter machine, among them those of Hermes, Ershov, Péter, Minsky, Lambek, Shepherdson and Sturgis, and Schönhage. These…
- Turing machine equivalents A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite…
- Mu operator In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property…
- One-instruction set computer A one-instruction set computer (OISC), sometimes referred to as an ultimate reduced instruction set computer (URISC), is an abstract machine that uses…
- Algorithm characterizations Algorithm characterizations are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are…