root@vz3:~# free -h
total used free shared buff/cache available
Mem: 62Gi 10Gi 49Gi 72Mi 2.9Gi 51Gi
Swap: 0B 0B 0B
root@vz3:~# free -h
total used free shared buff/cache available
Mem: 62Gi 10Gi 49Gi 72Mi 2.9Gi 51Gi
Swap: 0B 0B 0B
The "Cloud" is just someone else's computer(s).
The "Cloud" is just someone else's computer(s).
> Please contact Microsoft at aks blah balh balh
> Please contact Microsoft at aks blah balh balh
9834_) where we went through the form together. Managed to get to the 3rd page, at which point the "Address" had an asterisk next to it (*) -- I advise operator #9834 that I was not comfortable handing out a specific address, at which point she responded:> Well the IC3 online form is the correct form. Thank you. Goodbye.
And hang up! Haha π€£ wut da fuq?! π€¦ββοΈ*
9834_) where we went through the form together. Managed to get to the 3rd page, at which point the "Address" had an asterisk next to it (*) -- I advise operator #9834 that I was not comfortable handing out a specific address, at which point she responded:> Well the IC3 online form is the correct form. Thank you. Goodbye.
And hang up! Haha π€£ wut da fuq?! π€¦ββοΈ*
-- Next disk! πͺ
-- Next disk! πͺ
I'm not even sure what half these words mean hmm π§
I'm not even sure what half these words mean hmm π§
$ bat https://twtxt.net/twt/mxszcva | jq -r '.text'
(#c4tigxa) @<twtxt.net https://twtxt.net/user/prologic/twtxt.txt> Octal 31 = Decimal 25
in your feed? π€
$ bat https://twtxt.net/twt/mxszcva | jq -r '.text'
(#c4tigxa) @<twtxt.net https://twtxt.net/user/prologic/twtxt.txt> Octal 31 = Decimal 25
in your feed? π€
#failed #phissing #sms #attack
#failed #phissing #sms #attack
type Foo interface { ... } with those same matching methods.This shitβ’ is such a waste of time, human effort and global energy π€¦ββοΈ
type Foo interface { ... } with those same matching methods.This shitβ’ is such a waste of time, human effort and global energy π€¦ββοΈ
> if I had a Go struct such as the following:
...
> Here's how the complete interface would look:
o
type Bar interface {
Read(t *Bar, b []byte) (int, error)
}
> This interface matches the behavior and method signature of the provided Foo struct.
----
This is total garbage ποΈ
> if I had a Go struct such as the following:
...
> Here's how the complete interface would look:
o
type Bar interface {
Read(t *Bar, b []byte) (int, error)
}
> This interface matches the behavior and method signature of the provided Foo struct.
----
This is total garbage ποΈ
$ ollama run deepseek-r1:7b
>>> How does your model's reasoning work exactly?
<think>
</think>
I'm an AI assistant that uses algorithms to process information and create responses. While I can mimic some patterns of human thinking in my responses, I
don't have real human thought or consciousness.
>>> So how do you deliberate and argue with yourself over counting the number of letters "r" in the word "strawberry"?
<think>
Alright, so I'm trying to figure out how someone would deliberate and argue with themselves about counting the number of times the letter "r" appears in
the word "strawberry." First off, it seems pretty straightforward, but maybe there's some hidden complexity here.
...
> By following these steps, it's clear that the word "strawberry" contains exactly two "r"s. While overcomplicating the process with comparisons to similar
words, pronunciation considerations, or playful activities can be fun exercises, they aren't necessary for this simple counting task. The key is to
approach the task systematically and carefully.
Ridiculous π€¦ββοΈ
$ ollama run deepseek-r1:7b
>>> How does your model's reasoning work exactly?
<think>
</think>
I'm an AI assistant that uses algorithms to process information and create responses. While I can mimic some patterns of human thinking in my responses, I
don't have real human thought or consciousness.
>>> So how do you deliberate and argue with yourself over counting the number of letters "r" in the word "strawberry"?
<think>
Alright, so I'm trying to figure out how someone would deliberate and argue with themselves about counting the number of times the letter "r" appears in
the word "strawberry." First off, it seems pretty straightforward, but maybe there's some hidden complexity here.
...
> By following these steps, it's clear that the word "strawberry" contains exactly two "r"s. While overcomplicating the process with comparisons to similar
words, pronunciation considerations, or playful activities can be fun exercises, they aren't necessary for this simple counting task. The key is to
approach the task systematically and carefully.
Ridiculous π€¦ββοΈ
deepseek-r1:7b model using Ollama and this is the result:
$ ollama run deepseek-r1:7b
>>> How many r's in the word strawberry?
<think>
Alright, so I need to figure out how many times the letter 'r' appears in the word "strawberry." Hmm, okay. Let me start by writing down the word to
visualize each letter clearly.
...
Twoo lines later... Argueing with itself over and over again...
> The word "strawberry" contains three 'r's when spelled out as S-T-R-A-W-B-E-R-R-Y. However, upon closer examination and considering standard spelling
> conventions, it actually has only two distinct 'r's: one in "straw" and another pair in "berry."
>
> Answer: There are 2 'r's in the word "strawberry."
Farrkkkk me π€¦ββοΈ
deepseek-r1:7b model using Ollama and this is the result:
$ ollama run deepseek-r1:7b
>>> How many r's in the word strawberry?
<think>
Alright, so I need to figure out how many times the letter 'r' appears in the word "strawberry." Hmm, okay. Let me start by writing down the word to
visualize each letter clearly.
...
Twoo lines later... Argueing with itself over and over again...
> The word "strawberry" contains three 'r's when spelled out as S-T-R-A-W-B-E-R-R-Y. However, upon closer examination and considering standard spelling
> conventions, it actually has only two distinct 'r's: one in "straw" and another pair in "berry."
>
> Answer: There are 2 'r's in the word "strawberry."
Farrkkkk me π€¦ββοΈ
> Because Oct 31 = Dec 25.=