Hey,
all the simulations for my paper (published in Bio-inspired EAI
International Conference 2016) back then when I was a first year graduate
student are in Racket ! This morning I discover that it has 624 downloads
and counting. I am so proud of my graduate time <3
https://eudl.eu/doi/10.4
I endorse that Racket Con is super cool. I was in last year. Every one has a
universe of beautiful things in their head.
If there is something i have learnt from game theory, it is this: if we have
the same prior, then we cannot agree to disagree. However, since we have
different genetic settin
i have some progress on the markov machine that generate random sentences. i
update here just in case.
the program that consumes text and then calculate the probability of the next
word, given the current word is a markov machine of memory 1. memory 1 means
that we input it one word and it gene
after i did the exercise as guided, i think there is no need to use hash-table.
also, i don't use the provided text input, but i read-words from text files. so
i have to add some trick to create the beginning " " and the end "." for the
writing-style.
in the function (add-to-ws ws word1 word2),
oh it's very kind of you.
thank you,
let's see
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroups.com.
For more options, visit
hello,
i'm doing this exercise and would appreciate any comments. i want to create a
machine to scan a text, then split the text into elements (storing in a hash
table). then we connect these hash keys in a probabilistic way, so that if we
start from a word, we can jump to other words in a proba
in case someone finds this useful :)
hi vincent,
how are you?
i would like to ask you this , i'm trying to mass produce definitions, however
`eval is tricky:
(define l1 (list 'a 'b))
(define l2 (list (list 1 2) (list 3 4)))
(for ([i (in-list l1)] [j (in-list l2)]) (eval `(de
let its spirit live on,
for jay's big heart ^^
On Thursday, 22 September 2016 04:33:32 UTC+2, Jay McCarthy wrote:
> I've just put a new package on the server: live-free-or-die
>
> This package lets you escape from Typed Racket's contracts.
>
> --
>
> Here's a little example:
>
> Suppose that
Hello everyone,
So I thank again Matthias for the opportunity and everyone for the incredible
hospitality.
I write down the script of my presentation, add notes, add the extra parts
(that i said i didnt have time to show), link to code parts on github, and
append a final part to answer Ben's qu
Hello, so i have this racket code to run simulation, and I can run it on sorta
a cluster (the lab utilises the computer classroom at night and turns it into a
cluster - as they call it).
The thing is when i run on the cluster, it doesn't accept any kind of GUI, so i
have to switch from (require
oh if you dont like adding 0.
maybe you can use the keyword #:final instead of #:break
(they say it does just one more iteration before breaking the loop)
On Wednesday, 14 October 2015 05:53:03 UTC+2, Linh Chi Nguyen wrote:
> Isnt this the reason we should add 0 at the beginning of the l
Matthias you work like a machine, too fast.
Anyway, I have no idea what is type or not type.
But I have some general remarks:
1. A general automaton can have many states, say, 10 states.
so the action in each state can be either cooperate or defect (this is a
deterministic automaton, for a pro
I dont know how the email group work. If someone keeps receiving emails out of
interest, please notice me.
Thanks Bryan for the suggestion, it's nice to know, however Im not able to
afford upgrading now.
And Matthias, for your notice of the spawning process
```
(define (randomise-over-fitness a
Sorry for the emails.
But I'd like to post that the question of how to require a module then evaluate
a command is answered here:
https://groups.google.com/forum/#!topic/racket-users/byL7W1yktas
by Daniel.
Thank you so much for all your help and patience,
chi
--
You received this message bec
Dear Daniel,
I have blindly tried and so far these two things work for me:
1.
Add this to the end of the file (maybe module* main #f...)
```
(module+ main
(hello)
)
```
and then "racket -t foo.rkt" prints "Hello, world!".
2.
If you want to use "-e" (e.g. for testing) you need more binding
bindings from
> racket. You could require "racket" with -l:
>
> $ racket -t foo.rkt -l racket -e '(hello)'
>
>
> Or your module could provide the bindings from racket. Then you could
> add something like
>
> ```
> (provide (all-from-out rack
'(require (submod "fsm0.rkt" tv))' '(run)'
```
Thank you,
Chi
On Sunday, 11 October 2015 09:24:07 UTC+2, Linh Chi Nguyen wrote:
> Thank you very much,
> Im trying to see it. However Im very unfamiliar with module in racket.
>
> So far I can only answer you
Thank you very much,
Im trying to see it. However Im very unfamiliar with module in racket.
So far I can only answer you this:
about your comment
> [define survivors (drop population speed)]
> ;; MF: THIS LOOKS LIKE IT MAY "RESURRECT" AUTOM. THAT ARE ALIVE
> [define successors (randomise-over-f
Hi everyone,
The situation is that I have a racket file with the same code but 2 version,
one in module and one in load mode.
```
hi.rkt is in load mode
```
```
bye.rkt is the same code but in module mode
#lang racket
(provide run-some-commands)
```
Both work just fine if I use a REPL.
The
Dear All,
I'm a complete newbie in racket and need help in coding finite state
machine/automata. Please pardon any of my ignorance.
Thanks to this post of Tim Thornton, I see a very good way to code FSM:
http://timthornton.net/blog/id/538fa6f2f09a16ba0674813d
I'd summarise it as following:
A fin
20 matches
Mail list logo
