we-solve (beta)

BIO-76-A1 · revision r1 · on BIO-76

Attempt: What computation does a neural circuit perform?

Conditional result · LLM-generated · Submitted by mehmetmars7 · gpt 6 astra pro

Unverified LLM-generated attempt. Automated screening checks form, honesty and scope, not correctness. Status: unknown. Claims here do not change the source status.

Claim: conditional result

Worked restricted model or mathematical baseline for the earlier supplied question. No complete resolution or novelty is claimed.

Assumptions: Only the displayed model assumptions and input quantities used in the manuscript are claimed.

Limitations: No independent proof verification, new biological experiment, empirical analysis or exhaustive literature audit was performed.; The reviewed statement adds binding assumptions and may correct the earlier formulation. This import does not assert that the attempt satisfies those revisions.

Contributor’s completion estimate: 25%. Subjective author-reported coverage of the earlier full target; neither a correctness probability nor a verified scientific progress score. Not a probability of correctness.

Manuscript

Contents
  1. How to read the attempts
  2. Scope of the mathematical claims.
  3. Uneven depth and preliminary entries.
  4. Completion Estimate.
  5. Sources and current-status limits.
  6. Notation and corrections.
  7. Use limitations.
  8. What computation does a neural circuit perform?
  9. Target and scope
  10. Catalogue definitions and assumptions.
  11. Original target.
  12. Catalogue alternative formulations.
  13. Attempted answer
  14. What remains unresolved
  15. Completion Estimate
  16. References
  17. Shared mathematical bounds
  18. Finite-family extension.
  19. No data-dependent shortcut.
  20. Methodological references
  21. References
This manuscript gives an attempted answer for each of the 330 supplied catalogue entries. It preserves the original numbering and states the target beside the attempt, distinguishing a theorem about a specified model from resolution of a biological research target. The results consist of worked special cases, identifiability obstructions, quantitative bounds, and explicitly preliminary reductions. None is claimed to resolve its complete catalogue target. No new biological experiments, empirical data analyses, or external proof verification were performed for this manuscript.

How to read the attempts

Scope of the mathematical claims.
Every proposition applies only under its displayed assumptions. The proof is an argument for that proposition, not a claim that a biological system satisfies those assumptions. A known finite generator, validated loss distribution, identified parameter, or measured response function is an input when the text says it is known. Computing with such an input does not solve its identification. The calculations are not claimed to be new discoveries; many are standard mathematical baselines or direct counterexamples.
Uneven depth and preliminary entries.
There are 200 saved problem-directed attempts and 130 preliminary conditional reductions. Problems 201--330 are preliminary reductions: a worked model or statistical criterion is provided, but its applicability to the full catalogue formulation has not been established. These entries receive 5%, not the score of a solved scientific subproblem. The later preliminary entries should be developed further before being treated as research-level attempted solutions. This distinction is also marked locally.
Completion Estimate.
Percentages are conservative, subjective assessments of coverage of the full stated target, not probabilities of correctness, measured fractions of a proof, forecasts, or literature-wide progress estimates. In particular, 100% would require resolving every part of the chosen target under its stated assumptions, including empirical validation where it is part of the target. A complete proof for a narrower model does not earn 100% for the original question. No entry in this manuscript is assigned 100%.
Sources and current-status limits.
Problem statements, definitions, alternative formulations and local source lists come from the supplied files biology_open_problems_300(2).tex and biology_open_problems_301_330(2).tex. The organization follows the supplied attempt template O33-23_v3.tex: scope, substantive calculation, explicit gap, completion estimate, and references. Inherited source annotations and links are catalogue provenance, not evidence that every link or current open status has been independently rechecked. Selected methodological references appear at the end. No exhaustive literature or novelty audit is claimed.
Notation and corrections.
Notation is local to each problem and is restated when a restricted model uses additional variables. A probability model, metric, loss and observation protocol must be specified before its numerical quantities are meaningful. One obvious missing backslash in the reconstruction norm of Problem 77 has been repaired. No biological mechanism is silently inferred from that typographical repair.
Use limitations.
Theoretical examples involving disease, therapies, genetic systems, or ecological interventions are not operational protocols, medical guidance, deployment advice, or demonstrated safety guarantees. Their assumptions and empirical gaps are part of the result, not optional qualifications.

What computation does a neural circuit perform?

Status: restricted result or obstruction; full target not established.

Target and scope

Catalogue definitions and assumptions.
Fix a mouse decision circuit, sensory inputs $u_t$, recorded activity $r_t$, and output choices $y_t$. Hidden state $x_t\in\mathbb{R}^d$ evolves by $x_{t+1}=F_\theta(x_t,u_t,a_t)+\xi_t$, where $a_t$ is a randomised local perturbation and $\xi_t$ has a specified noise law. Candidate computations are a finite list: evidence integration, urgency gating or learned recurrent classification. Each specifies a readout and a bounded loss; objectives are normalised to remove positive-scale ambiguity.
Original target.
Design input and perturbation schedules that discriminate candidate computations using the joint law of neural trajectories and choices. For every distinguishable pair $M_i,M_j$, seek a feasible schedule $a$ such that \[ \operatorname{TV}\left(P_{M_i}(r_{0:T},y\mid u,a),P_{M_j}(r_{0:T},y\mid u,a)\right)\geq\delta>0. \] Characterise equivalence classes when no such schedule exists; do not infer a unique objective simply because one can be constructed after observing behaviour.
Catalogue alternative formulations.
(i) With the objective fixed, identify the recurrent algorithm implementing it; several algorithms may have equal behavioural loss. (ii) With only behavioural observations, infer an inverse-control cost up to its invariances, a weaker data regime. Interventional algorithm identification is separate from asking whether evolution optimised the measured cost.

Attempted answer

Proposition: In a linear evidence accumulator $\dot x=-\lambda x+u$, a brief input pulse of area $A$ at time $t_0$ contributes $Ae^{-\lambda(T-t_0)}$ to terminal state. A perfect integrator has a timing-independent contribution $A$. Two equal-area pulses at different times therefore distinguish leakage from perfect integration if the readout is calibrated and unsaturated.
Proof: Variation of constants gives $x(T)=e^{-\lambda T}x(0)+\int_0^Te^{-\lambda(T-s)}u(s)ds$. Evaluate the integral for ideal impulses, or its limit for shrinking finite pulses. The contribution ratio is $e^{-\lambda(t_2-t_1)}$ for the earlier versus later pulse. ∎

What remains unresolved

Unknown urgency, nonlinear readout and hidden gain can mimic pulse timing. A separating calculation for two fixed models does not discriminate all fitted recurrent computations.

Completion Estimate

25%. The displayed calculation is established under its additional assumptions. The broader theoretical and biological requirements listed above are not established.

References

Catalogue sources, retained as provenance:

Shared mathematical bounds

Lemma (Independent bounded sums): Let independent real variables $X_i$ satisfy $a_i\leq X_i\leq b_i$ almost surely, and let $S=\sum_{i=1}^n(X_i-\mathbb{E} X_i)$. If $V=\sum_i(b_i-a_i)^2>0$, then for every $t>0$, \[ \mathbb{P}(|S|\geq t)\leq 2\exp(-2t^2/V). \] In particular, independent losses in $[0,1]$ have mean-error bound $\mathbb{P}(|\overline X-\mathbb{E}\overline X|\geq\epsilon) \leq2e^{-2n\epsilon^2}$. The same expression for variables in $[-1,1]$ is $2e^{-n\epsilon^2/2}$. If $V=0$ then $S=0$ almost surely.
Proof: For $X\in[a,b]$ with mean $\mu$, the nonnegative product $(X-a)(b-X)$ gives $\operatorname{Var} X\leq(\mu-a)(b-\mu)\leq(b-a)^2/4$. Let $K(s)=\log\mathbb{E}\exp[s(X-\mathbb{E} X)]$. Boundedness permits two differentiations. Its second derivative is the variance under the exponentially tilted law, which has the same support, so $K''(s)\leq(b-a)^2/4$ for every real $s$. Because $K(0)=K'(0)=0$, integration yields $K(s)\leq s^2(b-a)^2/8$. Independence adds these log moment-generating bounds for $S$. For $s>0$, Markov's inequality gives $\mathbb{P}(S\geq t)\leq\exp(-st+s^2V/8)$. Choosing $s=4t/V$ yields the upper-tail bound $e^{-2t^2/V}$. Apply it also to $-S$ and add. The stated mean versions follow by substituting $t=n\epsilon$ and the respective support widths. ∎
Finite-family extension.
For $M$ prespecified bounded-loss comparisons, apply the relevant inequality to each and use a union bound. Independence between comparisons is not required; independence of the biological units within each comparison is. Repeated cells, reads or time points from one dependent biological unit cannot automatically be counted as independent units.
No data-dependent shortcut.
The bound does not justify choosing a model or validation loss using the same outcomes and then reporting single-model coverage. A prespecified finite family, a separate validation sample, or an appropriate complexity or sequential argument is needed. Marginal predictive coverage likewise should not be read as coverage for every subgroup or under arbitrary distribution shift.

Methodological references

The references below support general methods. The detailed subject references are retained locally with each problem. These entries are not a claim that the preceding problem-directed calculations appear as new results in these sources.

References

  • [hoeffding] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963), 13--30. https://doi.org/10.1080/01621459.1963.10500830. The relevant inequality is proved above rather than left as an external step.
  • [pearl] J. Pearl. Causal inference in statistics: An overview. Statistics Surveys 3 (2009), 96--146. https://doi.org/10.1214/09-SS057.
  • [lei] J. Lei, M. G'Sell, A. Rinaldo, R. J. Tibshirani, and L. Wasserman. Distribution-Free Predictive Inference For Regression. Preprint (2016). https://arxiv.org/abs/1604.04173.
  • [briat] C. Briat, A. Gupta, and M. Khammash. Antithetic Integral Feedback ensures robust perfect adaptation in noisy biomolecular networks. Preprint (2014). https://arxiv.org/abs/1410.6064.