Revealed forecasts and choice

A forecast can change the process it predicts. A disclosed prediction is a physical input with a route, a deadline and a receiver policy. The fixed-point analysis separates an impossible universal promise from ordinary successful prediction. Hidden forecasts, cooperating receivers, opposition and calibrated probability messages have different contracts. None supplies independent self-origination merely by being hard to predict.

14 Revealed forecasts and choice

14.1 What the predictor objection actually establishes

Ismael’s discussion of the Paradox of Predictability supplies a useful bridge between a global description and the activity represented within it. A prediction disclosed to its subject can become an input that changes the predicted behavior. Her red-green device makes the point without appealing to human exceptionalism: it produces the opposite of the announced output (Ismael 2016, 170-74). The distinction concerns the forecast’s actual route into a controller. Deterministic evolution need not make a universally correct forecast available through every possible channel before the event it predicts.

The claim needs a precise contract. Let $p\in\{0,1\}$ be an unambiguous forecast of the actual binary action $A$. The forecast is written and retained before the action. Its disclosed content reaches an available read port before the response deadline. The receiver has an installed, functioning policy that decodes that same bit and produces $A=1-p$. Both output commands are admitted; no later override, disabled actuator or changed decoding intervenes. These are conditions of the example, rather than universal capacities attributed to people. In particular, learning that someone can forecast an action does not establish that the forecast will be disclosed or that the person can perform its contrary.

Proposition 14.1 (Obstruction to an exact disclosed forecast). Under the preceding disclosure and opposition contract, no forecast is perfectly correct about the ensuing action.

Proof. Correctness requires $p=A$. The installed route requires $A=1-p$. Together they give $p=1-p$, which has no solution in $\{0,1\}$. Equivalently, each possible forecast is false after its receipt: $p=0$ produces $A=1$, and $p=1$ produces $A=0$. ◻

This standard feedback argument does not identify a contradiction in deterministic physics. It identifies an inconsistent conjunction of a particular response policy, timely disclosure and exact predictive success. Every actual run of a deterministic inverter is perfectly consistent. The forecaster’s promise fails on that run. Adding more precision, faster calculation or a complete description of the inverter cannot supply a fixed point that its response function lacks. Ismael expressly distinguishes this mechanism from finite computational limitations and from an intelligence outside the predicted interaction (Ismael 2016, 171-73).

The timing and resource clauses matter. Reading, decoding and issuing the contrary command must fit within the deadline and actual energy, memory and actuator budgets. A disclosed bit that arrives after commitment is not an input to this response. A blocked read route leaves the receiver’s previous policy in place. An involuntary movement may not possess two callable alternatives. The proposition establishes no general ability to defeat a forecast under such conditions. Nor does it show that a reflective intention always reaches its actuator: that is an implementation question of the kind isolated by the acquisition, assessment and commit routes above.

14.2 Consistency depends on the receiver’s policy

For a deterministic receiver $A=d(p)$, exact disclosed prediction requires a fixed point $p=d(p)$. The complete finite classification is simple:

Only opposition lacks a fixed point. The table classifies consistency of the displayed forecast-response relation; it does not promise that a forecaster can find a fixed point whenever one exists under arbitrary additional laws or resource limits. It also makes clear why announcing a forecast need not defeat it. A compliant receiver can help make it true. Ismael acknowledges both secret correct forecasts and revealed forecasts that are borne out (Ismael 2016, 188). The obstruction is therefore to universal exact success across the admitted responsive policies, not to every particular successful prediction.

Example 14.2 (A correct hidden forecast). Let a retained input be $B\in\{0,1\}$. At the earlier forecast stage set $P=B$ in a register without a read path to the action selector. At the later action stage let the installed policy produce $A=B$. For either input, $P=A$. Both equations and their schedule are deterministic. Forecasting succeeds because recording $P$ does not introduce the contrary-response relation into the action route.

Keeping the forecast hidden is not a failure of determinism or a mysterious restraint on the agent. It changes the information-access contract. If a new channel is opened and an inverter installed, one has changed the causal organization being predicted. A purported prediction of the modified organization must include those modifications. Holding a prediction fixed while installing a new receiver policy is not holding the whole physical preparation fixed. Conversely, holding an entire deterministic history fixed already holds its receiver policy, message and response fixed together.

There are also different prediction targets. A forecaster might correctly report the receiver’s policy, correctly forecast its output conditional on either possible message, or correctly forecast what it would do without disclosure. None of those achievements is the unconditional exact forecast of the action after disclosure prohibited by Proposition 14.1. For the inverter, the conditional forecasts are particularly easy: each possible message has a completely determined response. The unavailable achievement is choosing a message that both identifies and survives that response. Knowing how a process reacts and possessing a successful way to inform it of its own reaction are different interface capacities. This distinction also prevents a misleading inference from unpredictability to intellectual depth: an elementary circuit suffices, while a sophisticated deliberator can remain predictable in cooperative circumstances.

The same distinction limits claims about probability forecasts. Suppose a disclosed message is a probability $r\in[0,1]$, rather than a forecast action bit, and the receiver uses an independent random source to satisfy

$$\mathbb P(A=1\mid r)=1-r.$$

Calibration of that message requires $r=\mathbb P(A=1\mid r)$, hence $r=1-r$. The forecast $r=1/2$ meets the requirement exactly. This is a counterexample to the claim that every probability forecast can be defeated by probabilistic opposition. It is not a theorem that every stochastic response rule admits a calibrated fixed point. Such existence results need additional assumptions on the response map. Calibration also differs from predicting the realized bit correctly on every trial.

14.3 A prediction can become part of what it describes

This distinction helps clarify the acquired self-model. The retained account $\hat R(C,S,D)=C\oplus\hat bSD$ predicts a nominated recommendation generator. When $\hat b=b$, changing the authority selector need not falsify that prediction: the generator can continue to emit the same recommendations while their role in action changes. The object predicted and the variable revised are different. A forecast of the final behavior, by contrast, must track whether assessment has installed the old or revised authority route, whether compensation operates, and whether the practical actuator record is calibrated. A correct prediction under the old policy cannot simply be reused as a law of the deployed revised controller.

A self-description that enters assessment is consequently more than an observational readout. Its realized record becomes part of the controller’s causal state. This does not make all accurate self-description self-defeating. The direction of the effect depends on what the receiver actually does with the description. A report register without write authority can remain causally ineffective. A helpful forecast may reinforce a plan; a mistaken forecast may prompt correction; a disclosed point forecast may meet an opposing policy. Each case requires its own route, task and comparison. The relevant lesson is to include uptake and application when specifying the predicted mechanism.

The comparison with Ismael should preserve her strongest limitations. She uses the predictor argument to challenge the thought that global laws stand in an agent’s prehistory as a separate enforcing agency, and proposes a distinction between local laws and global laws of temporal evolution (Ismael 2016, 175-81, 186-90). The finite obstruction does not itself prove that metaphysics of law. A view with governing deterministic laws can also describe an inverter and deny that a universally correct disclosed forecast exists for it. Logical entailment does not automatically provide a physically available prediction token, and logically equivalent descriptions are not automatically interchangeable within causal chains. The fixed-point proof establishes the needed limitation without that stronger inference. Ismael herself notes possible irreducible global constraints in general relativity and the incompleteness of deeper physics (Ismael 2016, 181, 233).

Nor does counterprediction create ultimate authorship. The person or device might have received its contrary policy through training, programming or manipulation. It can defeat a disclosed forecast while lacking any authorship of that policy’s enabling basis. Conversely, a person who has good reasons to cooperate with a forecast need not be less self-governing because the prediction succeeds. Informational resistance, practical agency, historical ownership and ultimate self-authorization remain different targets.

Ismael’s language of a subsystem having a last say is strongest as a claim about its response to incoming information (Ismael 2016, 178-80). It should be read alongside her explicit rejection of complete self-creation and agreement that we do not choose our entire constitutional basis (Ismael 2016, 193 n. 2; p. 204 n. 16). Her practical alternatives also compare different contributions of the agent while keeping its environment fixed, rather than fixing the complete world including the agent (Ismael 2016, 230 n. 9). These distinctions allow a constituted participant’s prediction-sensitive conduct to remain real without converting a feedback limitation into independent origination.