We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Slide-rule completeness
Jump to navigation
Jump to search
A machine is slide rule-complete if said machine can perform any operation that can be simulated by a slide rule of arbitrary length with arbitrary markings.
Slide rule machine
A slide rule machine is an automaton that operates by moving a sliding scale $ c $ relative to two fixed scales, $ d_{1} $ and $ d_{2} $, according to a set of rules.
All unary functions can be simulated by a slide rule machine.