Factorization / CONCEPT
Exact Prime Division Defeats Every Finite Automaton
A prime multiply-divide register defeats every finite-state automaton at each positive power.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH2
DOCUMENT LINKS1
No finite automaton decides the threshold
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Binary Zeckendorf Block Codes and Transient Signaturesstructural-affinity · Closed
- Domains of Guarded Translation Wordsstructural-affinity · Closed
- Golden Base-Four Interval Machinestructural-affinity · Closed
- Labeled Prefix Occurrencesstructural-affinity · Closed
- Reachability Cardinality in Binary Typed DFAOsstructural-affinity · Closed
- The Exact Binary Base Languagestructural-affinity · Closed
- Two-Boundary Observation of a Prime Registerstructural-affinity · Closed
- Typed Partial DFAOs over a Numeration Basestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance