{"id":"0c642fe7-65f3-41b2-a52d-35e87ce3fb06","arxiv_id":"1908.04264","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"A topological Turing machine defined as a gauge group over a simplicial-complex environment is claimed to be a universal model for interactive computation, but the claim is not proven.","lead":"This paper proposes a topological Turing machine, a model that wraps interactive computation and its environment into a topological space described by simplicial complexes and fiber bundles. It is a conceptual proposal extending the persistent Turing machine framework, but the formal definitions and proofs are deferred to future work.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Definition 7 identifies a TTM with a group G = GAP ∧ GMC but never defines what it means for that group to compute, so Theorem 4's 'effective computation for a TTM' is not a well-formed statement.","rationale":"The reader's weakest_assumption identifies the semantic adequacy of the simplicial environment SP as the load-bearing premise. I agree that this is a serious gap, but I locate the more fundamental issue one step earlier: Definition 7 does not define the TTM's computational semantics at all, so the question whether topology faithfully encodes constraints cannot yet be asked in a precise way. The recalled results about PTMs from Goldin and Smolka are established, and the paper is honest that the full formalization is left to future work; however, the new central claims are phrased as theorems and theses, not as conjectures or research programs. Without an operational definition of computation by the group G, Theorem 4 is a placeholder, and Thesis 2 is untestable. This supports the reader's REJECT verdict: the paper's new contributions are not supported as stated. The concern is internal to the paper's own definitions rather than a disagreement with an outside consensus: no external assumption is being challenged, only the absence of a defined object. The concrete test would require either supplying the missing semantics and a proof, or explicitly demoting the claims to conjectures, which is exactly what the manuscript's own 'future work' sentence concedes.","tokens_in":11918,"tokens_out":3585,"duration_ms":36194,"concrete_test":"Ask the authors to supply a complete formal semantics for the TTM of Definition 7: specify the alphabet, the configuration set, the transition relation, and the acceptance condition for interaction streams, and define GAP and GMC as groups with explicit operations (or identify the claimed semi-direct product). Then attempt to prove Theorem 4 from these definitions together with Definitions 6 and 8. If the semantics cannot be given without borrowing unexplained notions, or if Theorem 4 still has no proof, the concern lands. A minimal instantiation would be to exhibit, for the genus-3 example in Figure 1, a concrete constrained interactive computation and the word in G that is claimed to compute it.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 4: any constrained interactive computation is an effective computation for a TTM; Thesis 2: any concurrent computation can be performed by a TTM) depends on Definition 7, which identifies a TTM with a gauge group G = GAP ∧ GMC. This definition is not operational in the required sense: no alphabet, generating set, configuration space, transition relation, or acceptance condition is specified for the group; in particular, 'GAP is the group of PTMs' is unexplained because PTMs are machines, not group elements, and ∧ is not defined (a semi-direct product is mentioned informally but never formalized). Consequently, the phrase 'effective computation for a TTM' in Theorem 4 has no formal semantics: there is no definition of what it means for a group element or group action to compute a constrained interactive computation. Proposition 1 only says that if G is automatic then L is regular; even if that conditional were applied, regularity is far too weak to support universality over all constrained interactive computations, and the paper does not show G is automatic or that the language of paths of SP is the language accepted by G. The paper itself states in Section 1 that 'We leave the formal definition and full formalization of the theory corresponding to the group of computations for an evolving environment as future work,' which is an explicit admission that the object in which Theorem 4 lives is not yet defined. Thus the load-bearing gap is not merely a missing proof but a missing definition of the computational model itself; until that definition exists, Theorem 4 and Thesis 2 are not well-formed statements.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper revisits the persistent Turing machine (PTM) model of Goldin and Smolka and proposes a topological generalization. The environment of a PTM is modeled as a simplicial complex SP built over the machine's configurations at each step, and a topological Turing machine (TTM) is defined as a gauge group G = GAP ∧ GMC, informally the semi-direct product of a group of PTMs and a simplicial analog of the mapping class group. The main claims are Theorem 4, that every constrained interactive computation is an effective computation for a TTM, and Thesis 2, that every concurrent computation can be performed by a TTM. The paper also recalls earlier PTM results, discusses persistent homology and path algebras as tools for representing constraints, and includes an appendix with standard definitions from algebraic and computational topology.","tokens_in":12280,"tokens_out":2889,"duration_ms":30843,"significance":"If the proposed formalization could be made rigorous, the paper would offer an original bridge between topological data analysis and models of interactive and concurrent computation, potentially giving a topological account of when an interaction is feasible. The paper has genuine strengths: it clearly motivates the need to represent the environment explicitly, it correctly situates the PTM in the literature on interaction, and it provides the relevant topological background in an appendix. The authors also honestly state that full formalization is left as future work. However, in its current form the central definitions are informal and the main theorems are unproved, so the paper functions as a position statement rather than a demonstrated technical result.","major_comments":[{"comment":"Definition 7 identifies a TTM with the group G = GAP ∧ GMC, but the constituent objects are not defined with enough precision for the definition to be operational. GAP is called 'the group of PTMs' although PTMs are machines, not group elements; GMC is called 'the simplicial analog of the mapping class group' without a precise construction; and ∧ is only informally described as a semi-direct product. No alphabet, generating set, configuration space, transition relation, or acceptance condition is specified for G. Consequently, the phrase 'effective computation for a TTM' in Theorem 4 has no formal semantics.","section":"Definition 7, Section 3"},{"comment":"Theorem 4 and Thesis 2 are stated without proof, and Section 1 explicitly says 'We leave the formal definition and full formalization of the theory corresponding to the group of computations for an evolving environment as future work.' Since Theorem 4 depends on the undefined notion of a TTM from Definition 7, the claimed universality result is not established. Moreover, because a TTM is defined as the group of all interaction streams generated by PTMs together with environment transformations, Theorem 4 is close to being true by construction; an independent, non-circular characterization is needed.","section":"Theorem 4 and Thesis 2, Section 3"},{"comment":"The load-bearing premise of the paper is that the feasibility constraints of an environment are faithfully encoded by the topology of the simplicial complex SP, specifically by its n-dimensional holes, genus, and path structure. This premise is assumed rather than proved: no argument is given that infeasible input-output relations correspond exactly to homology classes or to non-contractible paths. Since the gauge group G is built from this same space, the correspondence between topological invariants and computational constraints must be established before Theorem 4 or Thesis 2 can be derived.","section":"Definition 6 and Figure 1, Section 3"},{"comment":"Proposition 1 states that if G is automatic then the associated language L is regular, and asserts that the syntax of L is contained in T and its semantics in M. Even if this conditional is accepted, regularity is far too weak to support the claimed universality over all constrained interactive computations. The paper does not show that G is automatic, nor does it show that the language of paths of SP is the language accepted by G, so Proposition 1 does not provide a bridge from the topological construction to Theorem 4.","section":"Proposition 1, Section 3"}],"minor_comments":[{"comment":"The paragraph begins 'n this section', which appears to be a typo for 'In this section'.","section":"Section 2, opening paragraph"},{"comment":"Some reference titles are heavily abbreviated, e.g. 'Why Intera. is More P Than Algorit.' and 'Churchs Thesis and Principles for Mechanisms', and the MathOverflow URL contains a non-ASCII 'fl' ligature in 'mathoverflow'; these should be cleaned up.","section":"References"},{"comment":"The text says the space S is 'homomorphic to 2-manifold with boundary'; the intended term is 'homeomorphic'.","section":"Figure 6 and surrounding text"},{"comment":"The caption lists 'a) homotopic paths a∼b' while the text discusses paths that are not homotopic in part (c); the labeling could be clarified to avoid confusion.","section":"Figure 2 caption"}],"recommendation":"reject","confidential_remarks":"The manuscript reads as a tribute and position note. The formal apparatus is not yet at the level required for the stated theorems to be accepted: the central object, the TTM, is not defined with enough precision, and the main results are explicitly deferred to future work. If the venue publishes informal position papers, an editorial note should make clear that Theorem 4 and Thesis 2 are conjectures rather than proved results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a tribute piece that sketches a topological Turing machine (TTM) built from a persistent Turing machine (PTM) and a simplicial-complex environment, with the machine-environment pair represented as a gauge group. The idea is genuinely new as far as I know, and it is not a restatement of Goldin and Smolka's work. The recalled results on PTMs and interactive transition systems are accurate, and the paper is honest that it is leaving the formal theory for future work.\n\nNow the soft spots. They are not minor. Definition 7 identifies a TTM with a group G = GAP ∧ GMC, but GAP ('the group of PTMs') is never defined, ∧ never gets a precise meaning (semi-direct product is mentioned informally), and no alphabet, transition relation, or acceptance condition is given for G. As a result, 'effective computation for a TTM' in Theorem 4 has no formal semantics. The paper itself admits that the group of computations for an evolving environment is not formalized. That means the universality claim (Thesis 2) is not a theorem yet, it is an intriguing hypothesis. The modeling assumption that the homology of a simplicial complex built over PTM configurations exactly captures which input-output relations are feasible is asserted, not argued. Proposition 1 is a conditional with no evidence that G is automatic; even if it were, regularity would not get you universality over all constrained interactive computations.\n\nWhat the paper does well: it positions the PTM in a wider picture, connects it to topological data analysis and gauge theory, and draws attention to the environment as a first-class object. That is worth saying. But the contribution is a research program, not a proved result.\n\nRecommendation: I would not send this to a standard theory journal for refereeing. It could be useful for a workshop or a speculative/computational-foundations venue where a referee can provide guidance on turning the sketch into something formal. As it stands, the load-bearing definitions are missing, and no amount of refereeing can fix that without an actual formalization.","headline":"A genuinely new but radically under-specified topological proposal for interactive computation; the central theorem is not yet well-formed.","tokens_in":12756,"tokens_out":2502,"would_cite":false,"duration_ms":24015,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68Q05","68Q10","68Q85","55N31"],"pacs":[],"model":"deepseek-v4-flash","headline":"A topological Turing machine, built from persistent Turing machine streams and topology-preserving transformations of a simplicial environment, is claimed to be a universal model for interactive and concurrent computation.","keywords":["persistent Turing machine","interactive computation","concurrent computation","topological Turing machine","simplicial complex","persistent homology","computational environment","gauge group"],"falsifier":"Construct two interactive machines whose configuration spaces produce simplicial complexes with identical homology groups but that, under the same environment, admit different sets of feasible interaction streams; if such a pair exists, the claim that holes fully encode infeasibility fails and Theorem 4 does not follow.","tokens_in":11690,"feed_emoji":"🔁","tokens_out":6364,"duration_ms":60208,"temperature":0.7,"pith_summary":"This paper argues that the environment in which a persistent Turing machine (PTM) operates can be made an explicit, dynamic part of the model by giving it a topology. It defines the topological environment as a simplicial complex built over the machine's configurations, so that holes and genus in that space mark input-output relations that are not feasible. It then defines a topological Turing machine (TTM) as the group generated by PTM interaction streams together with topology-preserving transformations of the environment, and claims that any constrained interactive computation is an effective computation for a TTM, and that any concurrent computation can be performed by one. If this holds, interaction and concurrency cease to be extras bolted onto Turing machines and become a topological property of computation.","feed_headline":"Topological Turing machine claims interactive computing universality","feed_subtitle":"The paper models the environment as a shaped space whose holes mark infeasible steps, making concurrency a topological matter.","key_machinery":"The central object is the gauge group $G = G_{AP} \\wedge G_{MC}$: the semi-direct product of the group of PTM interaction streams ($G_{AP}$) and the simplicial analog of the mapping class group ($G_{MC}$), the transformations of the simplicial environment that preserve its topology. This group is realized through a fiber bundle with base space $B$ (input/output strings embedded in a simplicial complex $S_P$), fiber $H$ (all possible computations), and total space $G$; the projection $\\pi$ maps total configurations down to feasible paths on the base, where holes in the topology mark relations that are locally consistent but globally inconsistent. The machinery uses persistent homology over PTM configurations to build $S_P$ and path algebra or quiver representations to generate the group.","core_discovery":"The paper's central claim is that a topological Turing machine (TTM)—formed as the group $G = G_{AP} \\wedge G_{MC}$ generated by the interaction streams of persistent Turing machines together with topology-preserving transformations of a simplicial environment—is a universal model for interactive computation: any constrained interactive computation is effective for a TTM (Theorem 4), and any concurrent computation can be performed by a TTM (Thesis 2). The argument identifies the environment's constraints with the topological invariants—$n$-dimensional holes, genus, and path structure—of a simplicial complex $S_P$ built over PTM configurations, and treats a computation as a path in that space. The paper also interprets contextuality, locally consistent but globally inconsistent data, as the topological obstruction that distinguishes effective computation from interactive computation.","pith_inferences":["If the encoding of constraints by homology is correct, one could predict infeasible input-output relations of an interactive system solely by computing persistent homology of its configuration space, without simulating the computation.","The gauge-group treatment suggests that different environments are not just different mappings but different topological structures, so machine equivalence becomes environment-dependent in a stronger sense than an observer-based partitioning.","The braid-stream picture hints at a testable bridge to topological quantum computation: TTMs sharing an environment could be realized as braid representations, and known topological quantum invariants might correspond to constrained computations.","A concrete extension would be to implement the construction on small PTMs to compute $S_P$ and its homology, then check whether divergent or deadlocked computations correspond to non-null-homotopic loops; this would move the model from interpretive to predictive."],"forward_implications":["Interactive computation becomes a topological phenomenon: feasible computations correspond to paths that avoid holes, while deadlock corresponds to hitting a boundary of the configuration space.","Combined with the known isomorphism between PTMs and interactive transition systems, Theorem 4 yields a topological model that is universal for sequential interactive computation.","Concurrent computation is captured by streams of interactions shared over a common topological environment, appearing in higher dimensions as braid-like structures.","Contextuality—families of data that are locally consistent but globally inconsistent—is represented by the topology of the environment and serves to distinguish effective computation from interactive computation.","If the TTM group is automatic, the associated language is regular, linking topological structure directly to formal-language syntax and semantics."],"supporting_citations":[{"why":"Defines the persistent Turing machine and proves the isomorphism with interactive transition systems, the base model on which the topological construction is built.","marker":"[1]"},{"why":"Introduces the environment for PTMs and the expressiveness hierarchy that the topological environment is meant to generalize.","marker":"[2]"},{"why":"Supplies the view of computation as evolution of an environment and the machine-learning paradigm that motivates making the environment explicit.","marker":"[7]"},{"why":"Provides the ambient-space and braid-stream picture used for the topological environment and for higher-dimensional concurrent streams.","marker":"[8]"},{"why":"Contributes the interaction matrix and the idea of discovering operators from environmental data, which the paper identifies with the learnt algorithm.","marker":"[9]"},{"why":"Supplies persistent homology as the procedure for constructing the simplicial complex from configuration data.","marker":"[10]"},{"why":"Gives the field-theoretic embedding of correlation functions into a simplicial-complex topological space, the basis of the fiber-bundle model.","marker":"[11]"},{"why":"Provides the fiber-bundle structure used to combine base space, fiber, and total space in the topological Turing machine.","marker":"[12]"}],"fun_headline_variants":["Topological Turing machine: universality via environment's shape","Concurrency as topology: TTM claims universal interactive model","Holes in space define feasible steps for Turing machine","Interactive computation is a path through topological holes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole construction assumes that the constraints an environment places on computation are faithfully captured by the topology of the simplicial complex built over the machine's configurations—holes and genus marking exactly which input-output relations are impossible.","fun_headline_variants_meta":{"raw":{"variants":["Topological Turing machine: universality via environment's shape","Concurrency as topology: TTM claims universal interactive model","Holes in space define feasible steps for Turing machine","Interactive computation is a path through topological holes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000462,"raw_usage":{"total_tokens":2224,"prompt_tokens":770,"completion_tokens":1454,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":386,"completion_tokens_details":{"reasoning_tokens":1391}},"tokens_in":386,"tokens_out":1454,"duration_ms":11097,"temperature":1.0,"reasoning_tokens":1391,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:19:20.396634+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct two interactive machines whose configuration spaces produce simplicial complexes with identical homology groups but that, under the same environment, admit different sets of feasible interaction streams; if such a pair exists, the claim that holes fully encode infeasibility fails and Theorem 4 does not follow.","supporting_citations":[{"cited_title":"Goldin, S.A","cited_arxiv_id":null,"evidence_quote":"Defines the persistent Turing machine and proves the isomorphism with interactive transition systems, the base model on which the topological construction is built."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the environment for PTMs and the expressiveness hierarchy that the topological environment is meant to generalize."},{"cited_title":"Wigderson","cited_arxiv_id":null,"evidence_quote":"Supplies the view of computation as evolution of an environment and the machine-learning paradigm that motivates making the environment explicit."},{"cited_title":"Garrone, A","cited_arxiv_id":null,"evidence_quote":"Provides the ambient-space and braid-stream picture used for the topological environment and for higher-dimensional concurrent streams."},{"cited_title":"Merelli, M","cited_arxiv_id":null,"evidence_quote":"Contributes the interaction matrix and the idea of discovering operators from environmental data, which the paper identifies with the learnt algorithm."},{"cited_title":"Carlsson","cited_arxiv_id":null,"evidence_quote":"Supplies persistent homology as the procedure for constructing the simplicial complex from configuration data."},{"cited_title":"Rasetti, E","cited_arxiv_id":null,"evidence_quote":"Gives the field-theoretic embedding of correlation functions into a simplicial-complex topological space, the basis of the fiber-bundle model."},{"cited_title":"Steenrod","cited_arxiv_id":null,"evidence_quote":"Provides the fiber-bundle structure used to combine base space, fiber, and total space in the topological Turing machine."}],"review_version":1}