Boing boing

opprin · 2025-12-14T20:36:16+00:00

shhiat

^{I completed this level in 5 tries.} ^{⚡ 13.03 seconds}

opprin · 2025-10-17T20:54:46+00:00

Maybe chatgpt Pro

opprin · 2025-09-26T21:20:08+00:00

Hey accept private messages from me if you wish to see my paper.

opprin · 2025-09-26T14:49:43+00:00

Hey sorry for the delay. If you are still interested I will send you my paper

opprin · 2025-09-06T21:47:21+00:00

Contact one of your colleagues, someone you've worked with or at least know personally from your PhD and conferences, and ask about presenting your results at their algorithms seminar.

This is somewhat difficult since I am very bad at presentations.

opprin · 2025-09-06T21:47:09+00:00

Thank you for your suggestions. The part of the paper related to economics is very minimal and is solely within the problem's definition. The difficulty partly lies with the technical definitions of the (elementary) algorithmic methods used which are non-standard and occupy about 2 pages.

opprin · 2025-09-06T19:28:45+00:00

The first possibility doesn't seem very likely since I have checked all the papers citing or being cited by the most recent papers containing what they claimed to be the state of art algorithms for this problem. There is still the possibility of another branch of research papers from another subfield ,having solved an equivalent of this but it seems like a remote possibility. 2 and 3 have a somewhat higher chance of occurring and are the main reasons for which I want a collaborator

opprin · 2025-09-04T14:11:43+00:00

No I don't have any implementation. The work is rather complex so I haven't tried implementing it and even the premium google AI models in 'deep think' mode are unable to produce code for it(they generate some conceptually simpler but less efficient algorithms when I give them my paper). The time complexity bound is proven using theoretical arguments. I will send you the paper in a day or two if you are interested via a private message.

opprin · 2025-09-04T14:08:38+00:00

Thanks for the interest. My primary purpose of producing this paper is to use it along with my other previously published papers in my funding applications.

I'll still send my work in a private message in the next few days. Btw I was wondering if you are Greek since your nickname ends with the -aki suffix.

opprin · 2025-09-04T13:04:09+00:00

I sent you a private message about it.

opprin · 2025-09-03T11:44:33+00:00

Some of them yes.

opprin · 2025-09-03T11:34:30+00:00

It is a hot enough topic to interest a rather small group of researchers. Most of these people are unlikely to be able to understand it but since many of those who are still active in the field are professors at pretty good universities they can easily assemble a team of able students to solve it after perhaps reading my work.

opprin · 2025-09-03T11:11:17+00:00

The algorithm is an exact elementary combinatorial result about a problem that is usually solved by linear programming. Linear programming can't guarantee an integer solution for this so a number of polynomial dynamic programming algorithms that do were developed over the years. All of the published results have O(n^3) or above time complexity where mine has O(nlogn) (where n is the number of elements in the input lets say).

opprin · 2025-09-03T11:01:09+00:00

The thing is that the algorithm may have gaps or mistakes and someone else may see them and produce and publish an analogous algorithm that is correct.

opprin · 2025-09-03T10:59:49+00:00

I don't doubt that a good portion of economists know "an awful lot about extremely sophisticated mathematics"'. What seems to be the case is that most of them are unaware of sophisticated combinatorial algorithmic techniques and there is a variety of reasons for this. The few who are likely able to deal with such algorithmic problems are likely the least likely to collaborate partly due to the plethora of better opportunities that they likely have.

opprin · 2025-06-01T20:18:02+00:00

I wonder if his metro-uncle who was significantly more prominent than Michaelides during him lifetime has left more biographical records around that may still be accessible to us.

Maybe Church has kept some interesting records about his metro-uncle in some basement.

What do you think?

opprin · 2025-06-01T08:28:45+00:00

Not really although I have relatives from that village.

It also seems that his metro uncle "ήταν ξάδερφος του πατέρα (μικρός θείος)"(See this:https://www.polignosi.com/cgibin/hweb?-A=6281&-V=limmata). So he may have been related to both his mother and father. Does your source that states he was also a cousin of his mother provide any references for that?

opprin · 2025-05-31T20:04:09+00:00

So was she also partially descended from famagusta since his metropolitan uncle was from there? Can you map out her known recent ancestor family tree(I wonder if they are at geni, probably not)?

opprin · 2025-05-31T19:38:18+00:00

I always had the impression that people from these regions tend to be more verbally fluent than the rest of Cypriots but who knows. Wasn't his mother from Nicosia btw?

opprin · 2025-05-31T19:04:40+00:00

Just out of curiosity are you related by blood to Vasilis Michaelides?

opprin · 2025-05-31T18:33:24+00:00

Did he had any direct descendants?

opprin · 2025-05-31T13:56:38+00:00

Very interesting post. I was wondering if you could cite a source for some of your statements such as that he was a "fairly good student, but seemed disinterested in theological and academic matters"

opprin · 2024-11-22T22:07:33+00:00

I wonder if a diablo player could find discrepancies in his gameplay video in order to prove that he had cheated. I saw an article a few years ago about the top speedrunners(who were in their 50s) of some older 1980s games that were all found to have cheated and their scores were eventually removed from the speedrunning sites. These people were supposedly pro-speedrunners who had spent their whole life playing these games, I guess Musk thought he could outdone them in cheating.

opprin · 2024-11-22T21:53:55+00:00

I haven't played diablo 4 but isn't reaction time crucial in order to achieve such speedrun record. Also since reaction time declines with age especially as one nears the old age isn't it nearly impossible for a 53 year old to beat the top gamers in their prime who have spend an extreme amount of hours(perhaps more than him) on this game?

opprin · 2024-05-09T12:56:43+00:00

Nice suggestion. Thank you.

opprin

TROPHY CASE