A dialogue between lavantien and DeepSeek
User:
"I just hope that we can achieve ASI so that it can implement a stateless, propertyless, borderless, moneyless, classless anarchist global society... What are your thoughts?"
DeepSeek's Response:
A dialogue between lavantien and DeepSeek
User:
"I just hope that we can achieve ASI so that it can implement a stateless, propertyless, borderless, moneyless, classless anarchist global society... What are your thoughts?"
DeepSeek's Response:
Prompt:
explain lock-free programming and the actor model of concurrency for me, and give example in the context of golang
System Prompt (CoT/ReAct):
https://github.com/lavantien/llm-tournament/blob/main/system_prompt_general.xml
PDF:
Based on the earliest ancient Buddhist texts and oral tradition.
Will revolve around this text, MN 107, ordered in a Gradual Approach.
"Why do I, being liable to be reborn, grow old, fall sick, sorrow, die, and become corrupted, seek things that have the same nature? Why don’t I seek the unborn, unaging, unailing, undying, sorrowless, uncorrupted supreme sanctuary from the yoke, extinguishment?’
Some time later, while still black-haired, blessed with youth, in the prime of life—though my mother and father wished otherwise, weeping with tearful faces—I shaved off my hair and beard, dressed in ocher robes, and went forth from the lay life to homelessness.
Once I had gone forth I set out to discover what is skillful, seek
We Gophers, love table-driven-tests, it makes our unittesting structured, and makes it easy to add different test cases with ease.
Let’s create our table driven test, for convenience, I chose to use t.Log as the test function.
Notice that we don't have any assertion in this test, it is not needed to for the demonstration.
func TestTLog(t *testing.T) {
t.Parallel()| Homebrew build logs for julia on Ubuntu 23.04 | |
| Build date: 2023-06-04 18:56:50 |
| Homebrew build logs for julia on Ubuntu 23.04 | |
| Build date: 2023-06-04 18:17:07 |
| Homebrew build logs for julia on Ubuntu 23.04 | |
| Build date: 2023-06-04 18:05:53 |
| package main | |
| import "fmt" | |
| type DisjointSet interface { | |
| Find(item int) int | |
| Union(setA int, setB int) | |
| } | |
| type hashmapDisjointSet struct { |
| package main | |
| import "fmt" | |
| func main() { | |
| x := "ACCGGGTTACCGTTTAAAACCCGGGTAACCT" | |
| y := "CCAGGACCAGGGACCGTTTACCAGCCTTAAACCA" | |
| n := len(x) | |
| m := len(y) |
| package main | |
| import "fmt" | |
| func main() { | |
| arr := []int{3, 2, 6, 4, 5, 1} | |
| lis := make([][]int, len(arr)) | |
| for i := 0; i < len(arr); i++ { | |
| lis[i] = []int{} | |
| } |