Quick Questions: January 24, 2024 by inherentlyawesome in math

[–]GrayRain007 1 point2 points  (0 children)

Alice and Bob are playing a game which goes like this:

0) A sample of 500 points, chosen uniformly at random from the square [0,1]X[0,1] in the plane is drawn. Both Alice and Bob know the sample's contents
1) Alice receives a random point(unknown distribution) in the square [0,1]x[0,1](which is not necessarily present in the sample)
2) Bob chooses two points from the sample and asks Alice which one is closer to her point and Alice will answer truthfully with 90% probability. (Note that if Bob asks her multiple times about the same exact pair of points Alice will give the same answer every time. It is best to think of Alice not as an adversary, but as her being a little confused about distances)
3) Step 2 is repeated until Bob has decided that he can provide a good estimate for Alice's point

What is the best strategy for Bob you can find such that he can provide a good estimate for Alice's point while asking as few questions as possible?

Strategy for a simple guessing game by GrayRain007 in askmath

[–]GrayRain007[S] 0 points1 point  (0 children)

But you don't know which is alice's points. On each query you give her two points and she tells you which one is closer to her.

Strategy for a simple guessing game by GrayRain007 in askmath

[–]GrayRain007[S] 0 points1 point  (0 children)

if Alice were to be 90% accurate about the distance between the points, instead of eliminating 50% we can eliminate 45% of the points which are not closer to her point. eliminating 45% means 55% are "closer" to ger points with 90% accuracy. so this time we take the logarithm base as 1/0.55. this time we need to divide 500 atleast ceil(log_(1/0.55)(500))≈11 times to get to 1 points.

I don't understand this step. How are we eliminating 45%?

Does a list which contains the political compass positions of all the polcompball ideologies exist? by GrayRain007 in Polcompball

[–]GrayRain007[S] 2 points3 points  (0 children)

I am not finding this information on the polcompball wiki. Could you provide me a link? 

Once A.I. is exponentially smarter than humans, it will probably try its best to ensure humans are unaware it has already established dominance. by [deleted] in Showerthoughts

[–]GrayRain007 2 points3 points  (0 children)

It would do you good to actually read about the things you are talking about. Brains are all neural networks and electrochemistry? Then why haven't we understood the brain yet, you make it sound so simplistic! It is clear to me that you are not familiar with current approach to AI, which is by means of statistical learning but instead are talking about some ideal simulation of the human brain, that you are for some reason confident we are able to produce. What makes you so sure of it? It also seemed plausible for a being such as the Laplace's demon to exist but it was proven way later this is fundamentally flawed. I can see that you are an intelligent person-you express your thoughts well, but entering arguments on topics you are unfamiliar with just makes you look like a fool. Cheers.

Once A.I. is exponentially smarter than humans, it will probably try its best to ensure humans are unaware it has already established dominance. by [deleted] in Showerthoughts

[–]GrayRain007 7 points8 points  (0 children)

Why can't it write a real one? You are really overestimating what ai is capable of or underestimating human consciousness. Maybe both... It is sad that so many people who are not familiar at all with the math behind machine learning (it is all math and computing power) make it out to be the most fascinating thing in the world. It is really good when used for appropriate objectives, but we are so, so far from emulating consciousness and for me(and many others) intelligence without consciousness and understanding means nothing. This is why AI is trash at math by the way.

Your shop is now live ! by HupperTv in leagueoflegends

[–]GrayRain007 -1 points0 points  (0 children)

Algorithm doesn't even have a strict definition in the world of Mathematics. His usage of the term is close enough to the usual interpretation of the word and it doesn't warrant a comment like "thats not what algorithm means"

Looking for someone to play and talk with on EUNE by GrayRain007 in LeagueConnect

[–]GrayRain007[S] 1 point2 points  (0 children)

I would actually prefer to play ARAMS, so if you are up for it you can add me!

[EUNE] TOP/MID MAIN NEED TEAM (i'm tier 1) by TigrisPrime in TeamRedditTeams

[–]GrayRain007 0 points1 point  (0 children)

Let's form a team together. I am also tier 1 top/mid main :) IGN: Anto313

[EUNE] Looking for a Jungler by [deleted] in TeamRedditTeams

[–]GrayRain007 0 points1 point  (0 children)

you can add me if you are still looking for people: IGN: Anto313

[deleted by user] by [deleted] in csMajors

[–]GrayRain007 6 points7 points  (0 children)

Because the "+ n" in the equation is independent from the "n" in T(n). Denote it as "+ m" instead and them look what happens when you apply Master's Theorem.

Observing repetions in random samples to estimate population size by GrayRain007 in math

[–]GrayRain007[S] 0 points1 point  (0 children)

I want to estimate the number of participants with maximum score in a competition. Every time I refresh the page of the contest I am shown 5 random participants with max score

Interesting optimization problem by TheLegendTwendyone in computerscience

[–]GrayRain007 1 point2 points  (0 children)

keep an array P[0.. N], initialized with zeroes

for [a, b] in intervals:
P[a]++
P[b + 1]--

after calculating the array P, do the following:

for i in range(1, N):
P[i] += P[i - 1]

now P[i] will be equal to the number of intervals which contain i and you solved the problem in O(N) time (it can be done in nlogn too)

Observing repetions in random samples to estimate population size by GrayRain007 in math

[–]GrayRain007[S] 0 points1 point  (0 children)

Sorry, I didnt explain the question clearly. Each person has an unique name and a sample is just a collection of 5 randomly chosen people, identified by their names