 Blum–Shub–Smale machine

The Blum–Shub–Smale (BSS) machine is a theoretical computational model used in computer science, particularly in the field of complexity theory. It is designed to operate over real numbers, extending the concepts of traditional Turing machines, which work with discrete symbols from a finite alphabet. The BSS model provides a framework for exploring computation involving real numbers and other computational constructs like algebraic numbers.