What joke? You presented this all as a completely factual thing that happened, and that you were the sole guardian of... non-cringe authenticity?... in the place, and that some loser thanked you for your service.
Now you're saying that the whole article was a lie?
Congrats, you're now even more disappointing of a person than originally presented.
The two minutes is a very short amount of time — much shorter than a typical speed dating slot of 5-10 minutes. People chat about all sorts of things: from work to previous relationships to “where are you from”-style questions.
With regular speed dating I had all sorts of chats, it usually enough for 1-3 threads of conversations.
This depends on your views on personal identity. It's not necessarily true that "you" exist from death to birth. Consciousness could be a singleton, and "You" could be everyone in the universe. Or perhaps "you" is only a single person-moment instantiated for a split second.
Telegram is more of a social media platform than a messenger. It has public 'channels' - read-only blogs without likes and comments. The biggest Belarusian channel 'Nexta' has 2M+ subscribers.
> Evolved player makes invalid moves far away in the board, causing opponent players to run out of memory and crash
Well, this sounds like speedrunning. People have found arbitrary code execution vulnerabilities in SNES and used them to jump to the credits (which counts as completed the game) in less than a minute: https://www.youtube.com/watch?v=Jf9i7MjViCE
In this case it’s just choosing an option that involves very large numbers because it’s learned that it’s opponent can’t handle large numbers. There’s no code injection
The SMB3 ACE is one of the most technically interesting glitches. The usual skips and saves are much more mundane.
My point here is that there is similarity between (some) human players and some AI players. Even the discussion whether exploiting a glitch is actually 'winning' also looks very similar.
To me it is kind of self-growing array that can hold objects of different types. The C++-ish equivalent would be something like std::vector<void*> / std::vector<MagicObjectBoxType> (there is no MagicObjectBoxType of course).
So... Because lists are dynamically typed and heterogeneous, does that mean the underlying C is basically a contiguous segment of memory of python object references? Then in cpython the actual list contents are Python objects sitting on the heap in a non-contiguous manner?
And when the list needs to be resized and doubles itself, it's just doubling the space for object references?
> Because lists are dynamically typed and heterogeneous, does that mean the underlying C is basically a contiguous segment of memory of python object references?
The growth pattern is still exponential, instead of going x -> 2 * x, you go x -> 9/8 * x + 6. I think it should still be O(1) amortized, you just need to adjust your proof for doubling a bit.
> So... Because lists are dynamically typed and heterogeneous, does that mean the underlying C is basically a contiguous segment of memory of python object references?
Yes. Every Python object is held by the interpreter as a pointer to a PyObject struct on the (C) heap.
Not something I would put into production, but had a fun application of this on a side project. I had the `id` of a function (but not the function object itself) and needed to recover the function. In CPython, `id` of a function corresponds to it's memory address (not sure if that can be overridden). By casting the id to a PyObject, I was able to recover the original.
reply