We introduce a lightweight and accessible approach to computation over the real numbers, with the aim of clarifying both the underlying concepts and their relevance in modern research. The material is intended for a broad audience, including instructors who wish to incorporate real computation into algorithms courses, their students, and PhD students encountering the subject for the first time. Rather than striving for completeness, we focus on a carefully selected set of results that can be presented and proved in a classroom setting. This allows us to highlight core techniques and recurring ideas while maintaining an approachable exposition. In some places, the presentation is intentionally informal, prioritizing intuition and practical understanding over full technical precision. We position our exposition relative to existing literature, including Matousek's lecture notes on ER-completeness and the recent compendium of ER-complete problems by Schaefer, Cardinal, and Miltzow. While these works provide deep and comprehensive perspectives, our goal is to offer an accessible entry point with proofs and examples suitable for teaching. Our approach follows modern formulations of real computation that emphasize binary input, real-valued witnesses, and restricted use of constants, aligning more closely with contemporary complexity theory, while acknowledging the foundational contributions of the Blum--Shub--Smale model.

翻译：我们提出了一种轻量级且易于理解的实数计算方法，旨在阐明其基本概念及在现代研究中的相关性。本材料面向广泛受众，包括希望在算法课程中融入实数计算的教师、其学生以及初次接触该主题的博士生。我们并不追求全面性，而是聚焦于一组精心挑选的结果，使其能够在课堂环境中呈现和证明。这使我们能够在保持平易近人的阐述风格的同时，突出核心技术和反复出现的思路。在某些部分，我们有意采用非正式的表达方式，优先考虑直觉理解和实际应用，而非完全的技术精确性。我们将本文的阐述与现有文献进行了定位，包括Matousek关于ER完备性的讲义，以及Schaefer、Cardinal和Miltzow近期关于ER完备问题的汇编。尽管这些工作提供了深入且全面的视角，但我们的目标是提供一个易于入手的切入点，并附有适合教学的证明和示例。我们的方法遵循现代实数计算的形式化表述，强调二进制输入、实数值见证以及对常数的限制使用，这与当代复杂性理论更为契合，同时承认Blum–Shub–Smale模型的基础性贡献。