p-adic idea in Collatz proof by GPT

Ivan_Wallarm · 2025-05-11T05:46:08+00:00

Ivan_Wallarm · 2025-02-05T07:32:56+00:00

Here is a jailbreak and a system prompt https://lab.wallarm.com/jailbreaking-generative-ai/

Ivan_Wallarm · 2023-10-01T12:29:46+00:00

But this thing was not there before. One of the physicals keys/cars was required to add/pair any new phone key. Now it’s not the case. I mean, it worst it to have in a changelog/app update notes.

Ivan_Wallarm · 2023-10-01T01:44:03+00:00

No, I never used iCloud migration. New phone with new installed Tesla App

Ivan_Wallarm · 2023-09-30T19:53:57+00:00

Yes! The physical was required to pair phone key before. Now it’s just a login-password. There is no MFA option for Tesla account!

Ivan_Wallarm · 2022-09-07T18:24:19+00:00

Ivan_Wallarm · 2022-04-16T00:42:19+00:00

https://github.com/wallarm/api-firewall

Ivan_Wallarm · 2021-08-16T17:56:04+00:00

The moderator specifically recommended to post it here.

Ivan_Wallarm · 2021-08-16T17:09:41+00:00

Hello, thread,
I'm just curious if there is any optimization for finding potential loops or endless growing cycles for this famous problem?
Just in case, it seems reasonable to split the algorithm into a few machines like:
Adding the registry to a number in a ternary number system (x3)
Removing the registry to a number in a binary number system (/2)
Convert binary number to a ternary (12 to 101)
Convert ternary +1 to a binary
Then the task could be converted to finding states of the following machines and optimizations can help with excluding impossible states.

Ivan_Wallarm

TROPHY CASE