Machine Learnability as a Measure of Order in Aperiodic Sequences
Posted3 months agoActive3 months ago
arxiv.orgResearchstory
calmpositive
Debate
20/100
Machine LearningAperiodic SequencesComplexity Theory
Key topics
Machine Learning
Aperiodic Sequences
Complexity Theory
Researchers propose a new measure of order in aperiodic sequences using machine learnability, sparking discussion on its implications for understanding complex systems.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
3d
Peak period
4
78-84h
Avg / period
2.5
Key moments
- 01Story posted
Oct 1, 2025 at 6:01 PM EDT
3 months ago
Step 01 - 02First comment
Oct 5, 2025 at 2:40 AM EDT
3d after posting
Step 02 - 03Peak activity
4 comments in 78-84h
Hottest window of the conversation
Step 03 - 04Latest activity
Oct 5, 2025 at 10:41 AM EDT
3 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
ID: 45444062Type: storyLast synced: 11/20/2025, 3:53:09 PM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
I wonder how machine learnability compares to other measures of chaotic structure, like multi-fractal approaches etc. I wouldn't be that surprised if it's accidentally the same or quite similar to some of the existing metrics.
> This aligns with number theory conjectures suggesting that at higher orders of magnitude we should see diminishing noise in prime number distributions, with averages (density, AP equidistribution) coming to dominate, while local randomness regularises after scaling by log x. Taken together, these findings point toward an interesting possibility: that machine learning can serve as a new experimental instrument for number theory.
n*log(n) spacing with "local randomness" seems like such a common occurrence that perhaps it should be abstracted into its own term (or maybe it already is?) I believe the description lengths of the minimal programs computing BB(n) (via a Turing machine encoding) follow this pattern as well.