FirsthandTech
arXiv: cs.AI preprintsInternational20 November 2026

A Geometric Coding Theorem

This is an official announcement record

Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.

arXiv:2607.13796v3 Announce Type: replace-cross Abstract: This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In th
Source: arXiv: cs.AI preprints

More from arXiv: cs.AI preprints

This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.