/sci/ - Science & Math » Thread #13425835

6KiB, 857x412, muhth.png

View Same Google iqdb SauceNAO

Search algorithm

Anonymous Fri 23 Jul 03:20:34 2021 No.13425835 View Reply Original Report

Quoted By: >>13427673 >>13427728 >>13428356 >>13428968

create a algorithm/routine which isolates repeating sub-patterns within an infinite sequence

Anonymous

Anonymous Fri 23 Jul 2021 04:30:09 No.13426003 Report

Quoted By: >>13427545

there is no efficient approach since any search method will take infinite time.

Quite Easily Done
Q.E.D

Anonymous

Anonymous Fri 23 Jul 2021 16:25:34 No.13427545 Report

Quoted By:

>>13426003
The sequence does not need to be infinite, but could you still efficiently find the repeating subsequence??

Anonymous

Anonymous Fri 23 Jul 2021 16:33:14 No.13427566 Report

Quoted By:

queue

Anonymous

Anonymous Fri 23 Jul 2021 17:16:25 No.13427673 Report

Quoted By: >>13427695 >>13428062

>>13425835
Look at every third term.
If it's 8, look at next term, if it's 2, look at next term. If it's 5, you're done.
If it's 2, look at previous term. If it's 8, look at term after 2, if it's 5, you're done.
If it's 5, look at previous term. If it's 2, look at previous term. If it's 8, you're done.
Keep going until you're done.

Anonymous

Anonymous Fri 23 Jul 2021 17:25:36 No.13427695 Report

Quoted By:

>>13427673
Yup it was always going to be linear

Anonymous

View Same Google iqdb SauceNAO 1626499108309.jpg, 184KiB, 1024x998

Anonymous Fri 23 Jul 2021 17:32:57 No.13427714 Report

Quoted By: >>13427716

I don't understand male hierarchy beyond one being the primary presenter of your own moment and the ease of its absorption/distribution to be somehow signaled or explained as useful metadata. Otherwise tag filtration wouldn't be a thing and how to search for a given cluster of moments is what the human brain calls arguments for a thing.

The question I primarily have though is how can we define the most distributive moment and how to contribute towards such an approach so we can just start helping each other helping language.

Thoughts?

Anonymous

Anonymous Fri 23 Jul 2021 17:34:54 No.13427716 Report

Quoted By: >>13427726

>>13427714
Who left his language bot on

Anonymous

View Same Google iqdb SauceNAO images (15).jpg, 22KiB, 600x315

Anonymous Fri 23 Jul 2021 17:40:30 No.13427726 Report

Quoted By:

>>13427716
Technically the rest of the universe that isn't my current biological host who processes the communication gateway between my expression and your interpretation. Shortened: Literally all of you did either through hoping to abstract away the problem or shift it to some other event-chain in the language.

>Removes all obstacles one's own judgement could ever be to one's own future glory and paradise, and everyone else's. Either simultaneously or discretely is fine with me.

Anonymous

Anonymous Fri 23 Jul 2021 17:41:16 No.13427728 Report

Quoted By:

>>13425835
Just zip it.
It's efficient for you, but not for the computer.

Anonymous

Anonymous Fri 23 Jul 2021 19:52:16 No.13428062 Report

Quoted By: >>13428075 >>13428251

>>13427673
The question more specifically was how can I find the repeating subsequence without knowing ahead of time that it is "8, 2, 5"

Anonymous

Anonymous Fri 23 Jul 2021 19:56:26 No.13428075 Report

Quoted By: >>13428088

>>13428062
Surely in an infinite, random sequence every subsequence will appear an infinite amount of times?

Anonymous

Anonymous Fri 23 Jul 2021 20:01:42 No.13428088 Report

Quoted By: >>13428105 >>13428143

>>13428075
The length of the sequence can be defined and shortened to "simplify" the problem. if the sequence was 1000 terms in length could you still solve the problem in an efficient manner?

Anonymous

View Same Google iqdb SauceNAO 1608973267546.jpg, 29KiB, 537x525

Anonymous Fri 23 Jul 2021 20:08:17 No.13428105 Report

Quoted By: >>13428125 >>13428137 >>13428144

>>13428088
start searching for a substring of length 1000/2 from index 0 to index 1000/2. if no match is found search for a substring of length 1000/2 - 1 and so on until your substring is of length 1 or 0

Anonymous

Anonymous Fri 23 Jul 2021 20:13:59 No.13428125 Report

Quoted By:

>>13428105
this means you will have to do at most (1000/2)^2 searches

Anonymous

Anonymous Fri 23 Jul 2021 20:17:13 No.13428137 Report

Quoted By:

>>13428105
actually you might have to start from index 0 to 1000 if the substrings can overlap. then you will have to do 1000^2 searches

Anonymous

Anonymous Fri 23 Jul 2021 20:18:10 No.13428143 Report

Quoted By: >>13428172

>>13428088
Then specify a sequence of length N. A finite and infinite sequence are two very different things.

Anonymous

Anonymous Fri 23 Jul 2021 20:18:14 No.13428144 Report

Quoted By:

>>13428105
the first solution is if substrings can't overlap. the second is more general

Anonymous

Anonymous Fri 23 Jul 2021 20:24:11 No.13428172 Report

Quoted By:

>>13428143
My bad. But the problem is all the same with a sequence having 10, 100, 1000, or a million terms.

Anonymous

Anonymous Fri 23 Jul 2021 20:33:49 No.13428222 Report

Quoted By:

So you're effectively asking for an algorithm to match a regex? This has been solved long time ago.

Anonymous

Anonymous Fri 23 Jul 2021 20:39:47 No.13428251 Report

Quoted By:

>>13428062
thats impossible, if its truly a random sequence, theres no way of knowing if any given substring is deliberate or random

Anonymous

Anonymous Fri 23 Jul 2021 21:05:08 No.13428356 Report

Quoted By:

>>13425835
>ctrl f
>8,2,5
>get infinite results

Predicting a perfectly random and infinite series is not impossible , but improbable

Anonymous

Anonymous Sat 24 Jul 2021 00:42:26 No.13428968 Report

Quoted By:

>>13425835
Ground state any numbers not = 8 or 2 or 5 in register. Any 3 ordered memory registers consuming power are your solution.

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches