What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction

Fabio F.G. Buono

REVIEW 4 major objections 5 minor 27 references

What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction

T0 review · 4 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Varying hidden assumptions yields a contradiction forcing P≠NP

desk verdict A paper with real but modest formal results (dynamic invariance, rolling-base secrecy) wrapped around an unproved claim to force P≠NP; the advertised contradiction never appears in the supplied text. read the letter →

arxiv 2608.00958 v1 pith:AD7XGLTM submitted 2026-08-02 cs.CR cs.LO

Fabio F.G. Buono This is my paper · ORCID

classification cs.CRcs.LO

keywords syntacticinvarianceprincipledynamicrewritingsystemsrolling-keysecrecysemanticunderdeterminationPvsNPtheoryofeverythingChaitin'sOmegaobserverhierarchy

topics P versus NP

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that one method — find what an accepted result silently assumed, make it a variable, and prove what follows once it is dropped — works across domains that share nothing else, and that applied to SAT it yields a contradiction from which coherence forces $\mathsf{P}\neq\mathsf{NP}$. The formal engine is the Dynamic Syntactic Invariance Principle (Theorem 3.3): the known static fact that a rewriting system can never expose the relative order of two frozen constants $a,b$ survives when the rules themselves evolve, provided the update is opacity-preserving. The same move is then carried into rolling-key cryptography (Theorem 5.5), into semantic underdetermination, where one derivation is compatible with two frames that answer $a+b=b+a$ oppositely (Theorem 7.2), into the impossibility of a countable theory of everything (Corollary 11.5), and into the claim that a computable algorithm's output can be fully meaningful yet indistinguishable from noise to every observer in a class. A sympathetic reader would take the paper to be establishing one recurring shape — a distinction real at a full level of description can be invisible at a restricted one — with the SAT contradiction as the payoff, and the author's own reservation stated as being about the proof, not about the answer.

What carries the argument

Opacity-preserving updates for dynamic rewriting systems (Definition 3.2). A dynamic rewriting system is a sequence of rule sets $(R_n)_{n\ge0}$ with local derivations, the next rule set chosen by an update rule $R_{n+1}=\upsilon(R_n,H_n)$ from the history $H_n$ of everything derived so far. The update is opacity-preserving when (i) the frozen constants $a,b$ are never fired on and never introduced by any rule at any step, and (ii) swapping $a$ and $b$ throughout the history leaves $\upsilon$'s output unchanged up to the same swap — the one genuinely new channel, with no static analogue, through which a moving rule set could leak the order. Theorem 3.3 lifts the static Syntactic Invariance P

What would settle it

Two checks would settle the load-bearing claims. For the theory-of-everything: show that every physically meaningful law is expressible in a fixed countable language, or that some genuine law is not a function $R^r\to R$ under Buckingham's reduction, and Corollary 11.5's conclusion no longer follows. For the Dynamic Syntactic Invariance Principle: build an update rule that violates swap-invariance (condition (ii)) yet keeps the order of $a,b$ hidden at every finite step — Proposition 3.6 leaves this open, so such a construction would show the claimed necessary condition is not necessary. The S

Watch

Extended reading notes

Core claim

The paper's central claim, stated in its own terms, is that a single argument shape — locate the silent assumption behind an accepted result, promote it to a variable, and prove what happens once it is allowed to vary — recurs across cryptography, the semantics of derivations, special relativity, the space of physical laws, and algorithmic randomness, and that in one instance it produces a contradiction forcing $\mathsf{P}\neq\mathsf{NP}$. Its formal core is the Dynamic Syntactic Invariance Principle: if a dynamic rewriting system is generated by an opacity-preserving update — one that keeps the Skolem constants $a,b$ untouched at every step and that, when $a$ and $b$ are swapped throughout

Load-bearing premise

The results rest on premises the paper itself flags: the no-theory-of-everything conclusion assumes the space of candidate laws is the set of all functions $R^r \to R$, so if the only laws anyone can state are the countably many expressible ones the diagonal argument collapses (Remark 11.1), and the Dynamic SIP leaves open whether its no-leak update condition is individually necessary (Proposition 3.6).

Editorial extensions

If this is right

Rolling-key secrecy persists: if a cipher's base evolves under a swap-blind update, an adversary learns nothing more about a past session's message even when handed every later base outright (Theorem 5.5), strengthening the static guarantee.
The same syntax can carry opposite meanings: one derivation under $\{A_1,A_2\}$ is compatible with two frames, one where $a+b=b+a$ holds and one where it fails, so no internal check can certify a reading (Theorem 7.2).
No countable theory of everything: any countable, even ever-growing, list of laws built from Buckingham's dimensionless groups misses a law produced by diagonalization (Corollary 11.5).
Meaningful output can be indistinguishable from noise: a valid algorithm's output can be opaque to every observer in a stated class, with Chaitin's $\Omega$ as the sharpest unconditional witness (Definition 12.3).
If the SAT contradiction closes, coherence forces $\mathsf{P}\neq\mathsf{NP}$, with the same hidden-assumption pattern claimed as the common engine behind all of the above.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The SAT derivation itself is not visible in the portion of the manuscript supplied: the contradiction is asserted in the abstract and announced in Section 1 as the true core, but the step-by-step argument is not before the reader, so the $\mathsf{P}\neq\mathsf{NP}$ claim rests on the abstract's authority (with its own stated reservation) rather than on a checkable derivation in view.
Read conservatively, the theory-of-everything corollary is a consequence of a modeling choice; the paper itself leaves open whether 'countable' is the right notion of what a theory or mind can produce. A natural extension would replace all functions $R^r\to R$ with the computable or definable ones and check whether the diagonal law stays outside the physically meaningful class.
The swap-blindness condition suggests a constructive research program: design rolling-base ciphers whose update is a provably order-blind function of history and test whether Theorem 5.5's guarantee survives — and conversely identify the minimal leak in an update that breaks secrecy, which would pin down the necessity result Proposition 3.6 leaves open.
The C-usable/C-opaque distinction could be lifted from a conceptual separation to a hierarchy by instantiating the observer class with standard complexity classes, connecting the paper's opacity notion to existing computational-indistinguishability machinery.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

You should know this before citing it: the abstract promises a contradiction forcing P≠NP, and Section 1 calls it 'the true core of this work.' I read the full text as supplied and no derivation of that contradiction appears anywhere in it. The visible results — Theorem 3.3 (Dynamic SIP), Theorem 5.5 (rolling-base secrecy), Theorem 7.2 (non-standard frame), the countability facts — are individually sound but none entails P≠NP. That gap is the whole story.

What is genuinely new and good: Theorem 3.3 and Corollary 4.4 are absent from the cited sources, and the paper correctly notes that [3] poses the rolling-base problem without solving it. Theorem 5.5 is a real extension in the swap-blind, partition regime, with a direct proof. The F2 model in Theorem 7.2 checks out, and the cardinality claims in Sections 8 and 11 are standard and correct. The paper is also honest in several places: Section 9 says an earlier two-axis construction was abandoned rather than repaired, and the remark after Proposition 10.2 concedes the pigeonhole collapse is about the paper's own apparatus, not the physics.

Soft spots, in proportion. The central advertised claim is unsupported in the supplied text. The 'sharp necessary condition' of Theorem 3.3 is overstated because Proposition 3.6 leaves individual necessity open. The 'mathematical certainty' about a theory of everything depends entirely on Definition 11.2's identification of laws with all functions R^r→R; the paper flags this in Remarks 11.1 and 11.7, but the section's opening box still oversells it. Section 12's definition of C-usable algorithms is fine, but it does not do the work the abstract implies. The fable in Section 8 is clearly non-formal and the author says so. Citation pattern is acceptable: the self-citations point to the specific results that anchor the machinery.

Who is this for? Someone interested in dynamic syntactic invariants and rolling-key secrecy could get value from Sections 3–5. Nobody should treat the P≠NP claim as established. I would not cite it in the next year. But I also would not desk reject it: the visible formal content is competent, and the missing SAT derivation might exist in the unshown sections. As received, REJECT with low confidence is the right verdict. Recommendation: send it to a serious referee, with instructions to ask for the derivation of the contradiction before anything else. If the author produces it, the paper becomes a major result; if not, the useful fragments could be salvaged as a short paper.

Referee Report

4 major / 5 minor

Summary. The paper develops a single method—identify what an accepted result silently assumes, make that assumption a variable, and prove what happens when it is dropped—and applies it across rewriting systems, cryptography, semantic frames, a two-selector machine, special relativity, a formal theory of everything, and observational indistinguishability. Its formal core is the Dynamic Syntactic Invariance Principle (Theorem 3.3), under an update condition called opacity preservation, from which the paper derives a rolling-base secrecy theorem (Theorem 5.5), a semantic underdetermination theorem (Theorem 7.2), cardinality facts about selectors and laws (Propositions 8.8, 11.3–11.5), and a C-usability framework for noise-indistinguishable output (Section 12). The abstract further announces that applying the method to SAT yields a contradiction from which P≠NP follows. In the text supplied, this SAT claim appears only in the Abstract and in Section 1's reference to "one apparent contradiction" that is "the true core of this work"; no theorem, proof, or section in the body states or derives that contradiction.

Significance. If the announced P≠NP consequence were actually proved, this would be a result of extraordinary significance. The present manuscript does not establish it: the visible theorems are conditional preservation statements, elementary cardinality facts, and definitional observations, none of which yields a complexity separation. Several pieces are genuinely correct and checkable: the nonstandard model in Theorem 7.2 satisfies axioms A1 and A2; the countability of E_sp and F_sp and the uncountability of the selector space in Section 8 are standard; and the diagonalization in Section 11 is valid as a cardinality argument. The paper is also unusually honest about its own limitations, explicitly flagging in Section 9 and in remarks after Proposition 10.2 that some conclusions are artifacts of the paper's formal apparatus rather than facts about the target domain. Nevertheless, the central advertised claim is unsupported, and the theory-of-everything conclusion collapses if its modeling premise is changed. The paper is therefore not publishable as a rigorous technical contribution in its current form.

major comments (4)

[Abstract; Section 1] The central advertised result—"Applied to SAT, this yields a contradiction from which coherence forces P≠NP"—is never derived in the supplied text. Section 1 calls this contradiction "the true core of this work," but no theorem, lemma, equation, or proof section states or proves it. The visible results are of three kinds: conditional syntactic preservation (Theorem 3.3 under Definition 3.2), elementary cardinality facts (Propositions 8.8, 11.3–11.5), and an observer-relative usability claim (Definition 12.3). None of these implies a lower bound against all polynomial-time SAT algorithms, and no bridge from "no observer in class C can verify/read the output" to "no polynomial-time algorithm can compute SAT" is supplied. The SAT step is the paper's headline; its absence is a load-bearing gap, not a presentation issue.
[Definition 11.2; Corollary 11.5; Section 11.7] The no-countable-theory-of-everything conclusion is an immediate consequence of the modeling choice L := {Φ : R^r → R}. With |L| = 2^c, the diagonalization of Proposition 11.4 is automatic, and Corollary 11.5 merely restates that a countable union of countable sets is countable. The paper's own remarks concede that "physical law is a function R^r → R" and "countable is the right notion of what a theory or a mind can produce" are unestablished assumptions about physical reality. If L is taken to be the countable set of laws expressible in a fixed language, the cardinality argument collapses. The section is therefore a conditional set-theoretic observation, not the "mathematical certainty" asserted in the claim box at the start of Section 11.
[Definition 3.2; Theorem 3.3; Proposition 3.6] The abstract describes condition (ii) of Definition 3.2 as "one sharp necessary condition," but the body proves only joint sufficiency. Theorem 3.3 assumes both (i) and (ii), and Proposition 3.6 explicitly says that the individual necessity of (ii) is open: "Whether an update violating (ii) but satisfying (i) must always expose the order, or whether some remain safe by accident, is not established." The Dynamic Syntactic Invariance Principle is therefore a conditional preservation theorem under an opacity-preserving update, not a characterization with a proved necessary condition. This overstatement matters because the "sharpness" of the dynamic principle is advertised as the paper's formal core.
[Section 12; Definition 12.3] Definition 12.3 correctly makes usability and opacity relative to a stated observer class C. However, the prose repeatedly asserts that a computable algorithm's output can be indistinguishable from noise "to every observer" and "unconditionally" (e.g., the remark beginning "A computable algorithm's output can be noise-indistinguishable to every observer..."). The structural mechanisms invoked do not support that absolute reading. The static SIP (Lemma 2.4) shows that a semantic invariant is invisible to syntactic derivations; an observer supplied with the relevant frame or interpretation is not within that restriction. Likewise, the encoding–frame mismatch of Section 8 shows opacity for a reader without the intended pair, not for a reader who possesses it. The absolute claim rests on an equivocation between "every observer in the named class C" and "every possible observer."

minor comments (5)

[Notation; Section 11 vs Section 7.6] The symbol L carries at least four meanings (candidate law space, number of confusion layers, formal language, ciphertext length). The initial disclaimer helps, but the same symbol in Sections 11 and 7.6 is genuinely confusing; consider renaming the law space or the layer count.
[Definition 8.9] Calling every non-computable selector an "oracle selector" is misleading, since no oracle is involved. The term should be "non-computable selector".
[Section 8; fable] The Hitchhiker's Guide fable and the line-by-line mapping table are disproportionate relative to the formal content. The paper says the fable is not part of the scientific contribution, but the surrounding remarks and table consume several pages; tightening this material would improve readability.
[Section 7.6; Proposition 7.8] The proof of Proposition 7.8 uses informal probabilistic language—"same distribution in the eyes of any observer"—without defining a probability space or distinguishing computational from statistical indistinguishability. The proposition should state explicitly which notion is being proved.
[General] Many cross-references are broken or unnumbered (e.g., "Remark 8" in Section 8, and repeated references to "Remark 7.1," "Remark 7.5," etc.). The bibliography also appears to be missing from the supplied text, despite many citations to [1]–[27].

Circularity Check

2 steps flagged · score 6.0 of 10

Theory-of-everything impossibility is a definitional corollary; Andromeda collapse is admitted to be a formal artifact; the advertised SAT/P≠NP contradiction is not derived in the supplied text.

self definitional [Definition 11.2, Proposition 11.3, Corollary 11.5, Remark 11.7]
"after Theorem 11.1 has reduced a phenomenon to r dimensionless variables, every candidate physical law governing it is, formally, a function Φ : R^r → R ... L := {Φ : R^r → R}. ... A countable union of countable sets is countable, so ⋃_k S_k is countable; Proposition 11.4 applied to this countable union gives Ψ ∈ L \ ⋃_k S_k."

The space of candidate physical laws L is defined to be the set of all functions R^r → R, which is already uncountable (indeed of cardinality 2^{2^{ℵ0}}). The conclusion that no countable, ever-growing sequence of written theories can equal L is then a direct corollary of this definition plus Cantor's theorem, not a theorem derived from physics. The paper's own Remark 11.7 leaves open whether 'countable' is the right notion of what a theory can produce, and if L were instead taken to be the countable set of laws expressible in a fixed language the result would collapse. Thus the advertised 'mathematical certainty' that no theory of everything can be written down reduces, by construction, to the definition of L.
self definitional [Section 10.4, Proposition 10.2 and following Remark]
"F_sp is countable (Proposition 8.4), so V = ⋃_{F∈F_sp} φ^{-1}(F) expresses V as a countable union ... some fibre is uncountable. ... This is not a fact about the physics; it is a fact about this paper's own formal apparatus."

The 'collapse' of continuum-many physical velocities onto one semantic frame is an immediate consequence of having defined F_sp as the countable set of computable frames (Definition 8.3), tied to Turing-machine codes. The paper itself concedes that the pigeonhole result is not a fact about special relativity but a fact about its own modeling choice. Consequently the Andromeda 'instance' does not supply an independent physical discovery; its conclusion is built into the countability of the frame space chosen earlier.

full rationale

The dynamic Syntactic Invariance Principle (Theorem 3.3) and its cryptographic extensions are not circular: Theorem 3.3 is proved by induction under two explicit conditions, and Theorem 5.5's conclusion is stronger than its swap-blindness assumption because the adversary receives the raw ciphertext history, not merely the swap-blind observer's summary, with fresh-key independence doing real work in the proof. The recovered static instances in Sections 5 and 6 are explicitly calibrations of already-known results, not new predictions, so the self-citations there are not load-bearing in the circular sense. The main definitional reduction is in the theory-of-everything material: L is defined as all functions R^r → R, so the uncountability and the diagonal law are placed inside the definition, making the no-countable-theory-of-everything corollary a direct consequence of that modeling premise rather than an independent result about physics. The paper is unusually transparent about some of this, notably in Remark 11.7 and in the remark after Proposition 10.2, but the abstract and claim box still present the conclusion as a 'mathematical certainty,' which is the kind of result that reduces by construction once the law space is chosen to be all functions. The abstract's central P≠NP claim, said to follow from a contradiction applied to SAT, is not derived anywhere in the supplied text; this is an unsupported assertion rather than a demonstrated circular step, so it does not itself contribute a quotable reduction, but it means the paper's strongest advertised result cannot be checked from the visible derivation chain. Overall, the paper has genuine independent content, but several of its headline instances—especially the theory-of-everything impossibility—are forced by its own definitions, warranting a partial circularity score of 6.

Assumptions & free parameters 0 free parameters · 9 assumptions · 3 invented entities

No numbers are fitted to data anywhere in the paper; the load-bearing choices are definitional and are listed as axioms. The uncountability of the law space (Definition 11.2) and the countability of computable frames (Definition 8.3) are the two modeling choices that generate the headline 'instances' of Sections 10 and 11, and both are concessively flagged by the author as assumptions rather than consequences. The Dynamic SIP imports its base case from the author's prior static result, and the crypto theorem imports the MR-OTP distributional facts from the author's prior work. The invented entities are conceptual rather than empirical, and none carries evidence independent of this paper.

assumptions (9)

domain assumption Lemma 2.2 (frozen subterm lemma) for {A1, A2} with Skolem constants a, b, imported from [7]
The Dynamic SIP rests on the static result it generalizes; [7] is prior work in the author's own program and is restated rather than re-proved.
ad hoc to paper Definition 3.2(ii): swap-invariance of the update function is the right formalization of 'the update does not leak the order'
Proposition 3.6 concedes individual necessity is open, so the abstract's 'sharp necessary condition' is not established; the condition carries much of the theorem's conclusion.
domain assumption MR-OTP distributional facts from [3]: C's distribution is independent of M given B (Prop 8.1), and the partition structure of [3, Def. 6.1] gives per-session key independence
Theorem 5.5's distributional induction depends on these imported facts, which are not re-derived here.
ad hoc to paper Definition 11.2: the space of candidate physical laws L is all functions Φ: R^r → R, so |L| = 2^c
The no-theory-of-everything conclusion is forced by this uncountability choice; Remark 11.1 concedes it is an assumption about physical reality the paper does not establish.
ad hoc to paper Definition 8.3: computable frames are exactly those given by Turing indices, making F_sp countable
Proposition 10.2's pigeonhole collapse to a single frame depends on this countability; the paper concedes the result concerns its own formal apparatus.
standard math Buckingham Pi theorem (Theorem 11.1)
Cited classical theorem from [2]; its correctness is not in question.
standard math Rice's theorem (Theorem 8.11)
Standard computability result invoked for Proposition 8.13; correctness not in question.
standard math Chaitin's Omega facts: prefix-free halting probability is Martin-Löf random and decides halting for short programs (Proposition 12.1)
Known theorem, cited [9, 18]; the paper relies on it without re-proving the randomness part.
domain assumption Enc_0 is a strong pseudorandom permutation whose output is indistinguishable from uniform (Propositions 7.6 and 7.8)
The blind-cascade cipher's indistinguishability claim rests on this standard but unproven assumption, which the paper states explicitly.

invented entities (3)

Orbital machine with two selectors σ_E and σ_F over E_sp × F_sp
purpose: Operationalizes the claim that encoding and interpretation are independent choices; underlies Categories 1-3 and the Rice-style transparency result
A packaging of standard Turing machines plus explicit encodings. The paper itself notes it adds no computational power beyond a Turing machine, so there is no falsifiable handle external to the paper.
Blind-cascade cipher Φ_s
purpose: Exhibits 'security by removal of the verification predicate': output indistinguishable from noise to anyone without the seed
A theoretical construction the paper states has essentially no practical use. Its security claim reduces to the assumed PRP property of Enc_0 and to the argument that no verification predicate exists, with no external attack surface analyzed.
C-usability / C-opacity (Definition 12.3)
purpose: Names the relative notion that an algorithm's output is meaningful yet indistinguishable from noise to a stated observer class
A definitional notion. Its instances (Omega XOR-pairings, pseudorandom generators) are standard objects, but the definition itself provides no new falsifiable handle.

how reviews work

0 comments

Cite this review

Pith. "Pith review of What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction." pith.science (2026). https://pith.science/paper/AD7XGLTM

@misc{pith2026260800958,
  author       = {Pith},
  title        = {Pith review of: What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AD7XGLTM}},
  note         = {Machine review of arXiv:2608.00958}
}

abstract

This paper develops a single method, find what an accepted result silently assumed, make it a variable, and prove what follows once it is dropped, and shows it keeps working across domains with nothing in common. Its formal core is the Dynamic Syntactic Invariance Principle: a known static inaccessibility result survives when a system's rules evolve in time, under one sharp necessary condition. A direct cryptographic payoff follows: the secrecy of a rolling-key scheme persists across sessions under a structural update, strengthening a static guarantee from earlier work. The same move is then carried into settings far from each other, special relativity, the reach of a formal theory of physical law, and computable output that is fully meaningful yet indistinguishable from noise to every observer, each established on its own terms, so the recurring structure beneath them is found, not imposed: a distinction real at a full level of description can be invisible at a restricted one. Applied to \textsc{SAT}, this yields a contradiction from which coherence forces $\mathsf{P}\neq\mathsf{NP}$, derived from what standard theory already admits rather than assumed,offered with one reservation, about the proof, not the answer.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 23 canonical work pages

[3]

F. F. G. Buono. From bits to mixed-radix keys: Horner decomposition, uniform sampling, and the information-theoretic QKD interface of the MR-OTP. Preprint, arXiv:2606.18526, 2026

arXiv 2026
[1]

Bernstein

F. Bernstein. Untersuchungen aus der Mengenlehre.Mathematische Annalen, 61(1):117– 155, 1905. Cantor–Schr¨ oder–Bernstein theorem; see also E. Schr¨ oder, 1898

work page 1905
[2]

Buckingham

E. Buckingham. On physically similar systems; illustrations of the use of dimensional analysis.Physical Review, 4(4):345–376, 1914

work page 1914
[4]

F. F. G. Buono. The observer world: a cryptographic extension of Impagliazzo’s five worlds. Preprint, arXiv:2606.27139, 2026

arXiv 2026
[5]

F. F. G. Buono. Observers, symmetries, and the hierarchy of language classes: a theory of computation parameterised by the observer. Preprint, arXiv:2606.27407, 2026

work page Pith review arXiv 2026
[6]

F. F. G. Buono. Syntactic separation implies computational indistinguishability: an ab- stract obstruction theorem. Preprint, arXiv:2606.29177, 2026

work page Pith review arXiv 2026
[7]

F. F. G. Buono. Syntactic systems cannot see semantic invariants. Preprint, arXiv:2606.17275, 2026

arXiv 2026
[8]

¨Uber eine elementare Frage der Mannigfaltigkeitslehre.Jahresbericht der Deutschen Mathematiker-Vereinigung, 1:75–78, 1891

Georg Cantor. ¨Uber eine elementare Frage der Mannigfaltigkeitslehre.Jahresbericht der Deutschen Mathematiker-Vereinigung, 1:75–78, 1891

work page

Show all 27 references

[9]

Gregory J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22(3):329–340, 1975

1975
[10]

Diffie and M

W. Diffie and M. E. Hellman. New directions in cryptography.IEEE Transactions on Information Theory, 22(6):644–654, 1976

1976
[11]

Kurt G¨ odel.¨Uber formal unentscheidbare S¨ atze der Principia Mathematica und verwandter Systeme I.Monatshefte f¨ ur Mathematik und Physik, 38:173–198, 1931

1931
[12]

Goldwasser and S

S. Goldwasser and S. Micali. Probabilistic encryption.Journal of Computer and System Sciences, 28(2):270–299, 1984

1984
[13]

H ˚ astad, R

J. H ˚ astad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function.SIAM Journal on Computing, 28(4):1364–1396, 1999

1999
[14]

Clause set cycles and induction.Logical Methods in Computer Science, 16(4):11, 2020

Stefan Hetzl and Jannik Vierling. Clause set cycles and induction.Logical Methods in Computer Science, 16(4):11, 2020. 87

2020
[15]

Impagliazzo

R. Impagliazzo. A personal view of average-case complexity. InProceedings of the Tenth An- nual Structure in Complexity Theory Conference, pages 134–147. IEEE Computer Society, 1995

1995
[16]

A. N. Kolmogorov. Three approaches to the quantitative definition of information.Problems of Information Transmission, 1(1):1–7, 1965

1965
[17]

L. A. Levin. On the notion of a random sequence.Soviet Mathematics Doklady, 14:1413– 1416, 1973

1973
[18]

The definition of random sequences.Information and Control, 9(6):602– 619, 1966

Per Martin-L¨ of. The definition of random sequences.Information and Control, 9(6):602– 619, 1966

1966
[19]

Oxford University Press, 1989

Roger Penrose.The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford University Press, 1989

1989
[20]

Time and physical geometry.Journal of Philosophy, 64(8):240–247, 1967

Hilary Putnam. Time and physical geometry.Journal of Philosophy, 64(8):240–247, 1967

1967
[21]

A. A. Razborov and S. Rudich. Natural proofs.Journal of Computer and System Sciences, 55(1):24–35, 1997

1997
[22]

H. G. Rice. Classes of recursively enumerable sets and their decision problems.Transactions of the American Mathematical Society, 74(2):358–366, 1953

1953
[23]

C. W. Rietdijk. A rigorous proof of determinism derived from the special theory of relativity. Philosophy of Science, 33(4):341–344, 1966

1966
[24]

C. P. Schnorr. Process complexity and effective random tests.Journal of Computer and System Sciences, 7(4):376–388, 1973

1973
[25]

G. J. Simmons. The prisoners’ problem and the subliminal channel. In D. Chaum, editor, Advances in Cryptology: Proceedings of Crypto 83, pages 51–67. Plenum Press, 1984

1984
[26]

Der Wahrheitsbegriff in den formalisierten Sprachen

Alfred Tarski. The concept of truth in the languages of the deductive sciences. Polish original 1933; German translation 1935 as “Der Wahrheitsbegriff in den formalisierten Sprachen”, 1933

1933
[27]

Alan M. Turing. On computable numbers, with an application to the Entscheidungsprob- lem.Proceedings of the London Mathematical Society, s2-42(1):230–265, 1936. 88

1936

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [3]

F. F. G. Buono. From bits to mixed-radix keys: Horner decomposition, uniform sampling, and the information-theoretic QKD interface of the MR-OTP. Preprint, arXiv:2606.18526, 2026

arXiv 2026

[2] [1]

Bernstein

F. Bernstein. Untersuchungen aus der Mengenlehre.Mathematische Annalen, 61(1):117– 155, 1905. Cantor–Schr¨ oder–Bernstein theorem; see also E. Schr¨ oder, 1898

work page 1905

[3] [2]

Buckingham

E. Buckingham. On physically similar systems; illustrations of the use of dimensional analysis.Physical Review, 4(4):345–376, 1914

work page 1914

[4] [4]

F. F. G. Buono. The observer world: a cryptographic extension of Impagliazzo’s five worlds. Preprint, arXiv:2606.27139, 2026

arXiv 2026

[5] [5]

F. F. G. Buono. Observers, symmetries, and the hierarchy of language classes: a theory of computation parameterised by the observer. Preprint, arXiv:2606.27407, 2026

work page Pith review arXiv 2026

[6] [6]

F. F. G. Buono. Syntactic separation implies computational indistinguishability: an ab- stract obstruction theorem. Preprint, arXiv:2606.29177, 2026

work page Pith review arXiv 2026

[7] [7]

F. F. G. Buono. Syntactic systems cannot see semantic invariants. Preprint, arXiv:2606.17275, 2026

arXiv 2026

[8] [8]

¨Uber eine elementare Frage der Mannigfaltigkeitslehre.Jahresbericht der Deutschen Mathematiker-Vereinigung, 1:75–78, 1891

Georg Cantor. ¨Uber eine elementare Frage der Mannigfaltigkeitslehre.Jahresbericht der Deutschen Mathematiker-Vereinigung, 1:75–78, 1891

work page