Similarities of CA Rule 150 and Odd Collatz-function outputs
up vote
3
down vote
favorite
I made a "discovery" a couple of weeks ago in regards to the first iterates of (odd) numbers of the form $2^n-1$ where $ninmathbb{N}$. First iterates is a bit loose term here; what I mean is all of the first consequtive odd numbers of the Collatz function iterates. The similarities are shown in the space-time diagrams of Rule $150$ and the first consequtive odd collatz iterates:
Iterates of the Collatz function: $(3n+1)/2$ if odd, or $n/2$ if even.
Rule 150 Elementary Cellular Automaton. Image courtesy WolframAlpha.
I have written a more detailed description of this discovery on my blog: https://sites.google.com/site/rudibstranden/
Since this happens for just a small subset of the domain it is still a surprising phenomenom (for me atleast). What I also pointed out in my blog is that the type of randomness or intricate structures that we see (the stuff inside pyramid) is produced with no random initial condition of the first input (since its just a string of $1$'s), but in Rule 150 this is total opposite: there is a random initial-condition (random $1$'s and $0$'s) that produce these structures as seen in the second figure above.
People who study Cellular Automata knows that this particular Rule (Rule $150$) is not often seen for Elementary Cellular Automata, like other rules ($60$, $90$ and so on) this is only happens once or twice out of the 256 rules (that has reversible or injective features). Does somebody knows what happens for these kinds of inputs and why it looks similar to Rule 150? I am also looking for a paper that explains why these structures look so similar and why this behaviour happens? Or I am wondering if I should write a paper about it, since I have not found this anywhere before. Thanks.
Edit: What kind of analytical tools (and analysis) can one use on these kinds of structures?
natural-numbers collatz cellular-automata
add a comment |
up vote
3
down vote
favorite
I made a "discovery" a couple of weeks ago in regards to the first iterates of (odd) numbers of the form $2^n-1$ where $ninmathbb{N}$. First iterates is a bit loose term here; what I mean is all of the first consequtive odd numbers of the Collatz function iterates. The similarities are shown in the space-time diagrams of Rule $150$ and the first consequtive odd collatz iterates:
Iterates of the Collatz function: $(3n+1)/2$ if odd, or $n/2$ if even.
Rule 150 Elementary Cellular Automaton. Image courtesy WolframAlpha.
I have written a more detailed description of this discovery on my blog: https://sites.google.com/site/rudibstranden/
Since this happens for just a small subset of the domain it is still a surprising phenomenom (for me atleast). What I also pointed out in my blog is that the type of randomness or intricate structures that we see (the stuff inside pyramid) is produced with no random initial condition of the first input (since its just a string of $1$'s), but in Rule 150 this is total opposite: there is a random initial-condition (random $1$'s and $0$'s) that produce these structures as seen in the second figure above.
People who study Cellular Automata knows that this particular Rule (Rule $150$) is not often seen for Elementary Cellular Automata, like other rules ($60$, $90$ and so on) this is only happens once or twice out of the 256 rules (that has reversible or injective features). Does somebody knows what happens for these kinds of inputs and why it looks similar to Rule 150? I am also looking for a paper that explains why these structures look so similar and why this behaviour happens? Or I am wondering if I should write a paper about it, since I have not found this anywhere before. Thanks.
Edit: What kind of analytical tools (and analysis) can one use on these kinds of structures?
natural-numbers collatz cellular-automata
add a comment |
up vote
3
down vote
favorite
up vote
3
down vote
favorite
I made a "discovery" a couple of weeks ago in regards to the first iterates of (odd) numbers of the form $2^n-1$ where $ninmathbb{N}$. First iterates is a bit loose term here; what I mean is all of the first consequtive odd numbers of the Collatz function iterates. The similarities are shown in the space-time diagrams of Rule $150$ and the first consequtive odd collatz iterates:
Iterates of the Collatz function: $(3n+1)/2$ if odd, or $n/2$ if even.
Rule 150 Elementary Cellular Automaton. Image courtesy WolframAlpha.
I have written a more detailed description of this discovery on my blog: https://sites.google.com/site/rudibstranden/
Since this happens for just a small subset of the domain it is still a surprising phenomenom (for me atleast). What I also pointed out in my blog is that the type of randomness or intricate structures that we see (the stuff inside pyramid) is produced with no random initial condition of the first input (since its just a string of $1$'s), but in Rule 150 this is total opposite: there is a random initial-condition (random $1$'s and $0$'s) that produce these structures as seen in the second figure above.
People who study Cellular Automata knows that this particular Rule (Rule $150$) is not often seen for Elementary Cellular Automata, like other rules ($60$, $90$ and so on) this is only happens once or twice out of the 256 rules (that has reversible or injective features). Does somebody knows what happens for these kinds of inputs and why it looks similar to Rule 150? I am also looking for a paper that explains why these structures look so similar and why this behaviour happens? Or I am wondering if I should write a paper about it, since I have not found this anywhere before. Thanks.
Edit: What kind of analytical tools (and analysis) can one use on these kinds of structures?
natural-numbers collatz cellular-automata
I made a "discovery" a couple of weeks ago in regards to the first iterates of (odd) numbers of the form $2^n-1$ where $ninmathbb{N}$. First iterates is a bit loose term here; what I mean is all of the first consequtive odd numbers of the Collatz function iterates. The similarities are shown in the space-time diagrams of Rule $150$ and the first consequtive odd collatz iterates:
Iterates of the Collatz function: $(3n+1)/2$ if odd, or $n/2$ if even.
Rule 150 Elementary Cellular Automaton. Image courtesy WolframAlpha.
I have written a more detailed description of this discovery on my blog: https://sites.google.com/site/rudibstranden/
Since this happens for just a small subset of the domain it is still a surprising phenomenom (for me atleast). What I also pointed out in my blog is that the type of randomness or intricate structures that we see (the stuff inside pyramid) is produced with no random initial condition of the first input (since its just a string of $1$'s), but in Rule 150 this is total opposite: there is a random initial-condition (random $1$'s and $0$'s) that produce these structures as seen in the second figure above.
People who study Cellular Automata knows that this particular Rule (Rule $150$) is not often seen for Elementary Cellular Automata, like other rules ($60$, $90$ and so on) this is only happens once or twice out of the 256 rules (that has reversible or injective features). Does somebody knows what happens for these kinds of inputs and why it looks similar to Rule 150? I am also looking for a paper that explains why these structures look so similar and why this behaviour happens? Or I am wondering if I should write a paper about it, since I have not found this anywhere before. Thanks.
Edit: What kind of analytical tools (and analysis) can one use on these kinds of structures?
natural-numbers collatz cellular-automata
natural-numbers collatz cellular-automata
edited Aug 16 at 17:29
asked Aug 16 at 14:38
Natural Number Guy
456415
456415
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2884831%2fsimilarities-of-ca-rule-150-and-odd-collatz-function-outputs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2884831%2fsimilarities-of-ca-rule-150-and-odd-collatz-function-outputs%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown