Where the Correction Freeze Problem Parts from Its Neighbors: A Table of Differential Predictions
Authors/Creators
- 1. Phenikaa University
- 2. Faculty of Nursing, Widya Mandala Surabaya Catholic University
Description
The Correction Freeze Problem (CFP) presents four routes by which a corrective mechanism stops registering change, and a hidden capture that follows when a frozen belief meets a self-reinforcing state. Each route resembles an established idea, so a fair reader may ask whether CFP is more than a relabeling. This note answers by setting each part of CFP beside its nearest neighbor and separating the predictions they share from those only CFP makes. The headline claim of each route, taken alone, is one its neighbor already makes. CFP's distinctive content lies in seven places: the step comparison inside Route 1, the joint update rule, the inheritance of a freeze from a stale reference, the claim that attention cannot lift detection above the information ceiling of Route 4, the contrast between exact and statistical freeze, hidden capture, and the complementarity of remedies. For each, we state what would count against CFP, summarize the evidence to date, and name the cheapest decisive test. Three of the seven have been examined directly and two more through loose readings; none has yet been tested in a way that separates CFP cleanly from its rivals.