On Thursday, September 5, 2019 at 10:14:15 PM UTC+8, Laurent wrote:
>
> This is utterly cool!
>
> If I may, I suggest to rebind up and down to page up and page down (or
> even the converse, as "down" means to me "go downwards towards Earth"), use
> the arrows to navigate NESW, and bind mouse sc
On Wednesday, September 4, 2019 at 7:50:19 PM UTC+8, Stephen De Gabrielle
wrote:
>
> Dr Racket is amazing. Need to a demo of this and plot side by side.
>
I can do better than just put a plot and a map widget side by
side: https://youtu.be/R2KU0ZvIJws
Alex.
>
> DrRacket is so close to bei
Is it possible to unload an ffi-lib? I'm doing development on Windows where
loading a DLL locks it and prevents the DLL from being recompiled.
There was another post on this, but it was about 7 years old, so I thought
I would see if anything has changed.
Thanks,
Chris
--
You received this mes
Den tor. 5. sep. 2019 kl. 23.27 skrev Josh Rubin :
>
> On 9/5/2019 9:05 AM, Adam Golding wrote:
> > What is the shortest/smallest racket program (ithat enumerates all and
> > only valid racket programs?
> >
>
> You might be interested in the logic-programming/constraint-solving
> language named mi
On Thu, Sep 05, 2019 at 10:46:54AM -0700, Adam Golding wrote:
> I want to try automating programming as search where I have various methods
> to enumerate the set of all programs in different orders (fastest to halt
> first? shortest source code first? etc.) and filter out certain programs
> al
With a Racket section to boot. Thanks so much for sharing this! I had no idea
about this kind of application.
Original Message
On Sep 5, 2019, 5:26 PM, Josh Rubin wrote:
> On 9/5/2019 9:05 AM, Adam Golding wrote:
>> What is the shortest/smallest racket program (ithat enumerates
On 9/5/2019 9:05 AM, Adam Golding wrote:
What is the shortest/smallest racket program (ithat enumerates all and
only valid racket programs?
You might be interested in the logic-programming/constraint-solving
language named miniKanren.
http://minikanren.org/
miniKanren can solve puzzles
It's as they say: if you want an answer on the internet, just say the wrong
thing and wait for someone to correct you. :)
Original Message
On Sep 5, 2019, 3:45 PM, Laurent wrote:
> Adam,
>
> I strongly recommend you take a look at Levin Search (aka Universal Search),
> which e
Adam,
I strongly recommend you take a look at Levin Search (aka Universal
Search), which enumerates and runs programs by dovetailing in a smart way:
http://people.idsia.ch/~juergen/mljssalevin/node4.html
http://www.scholarpedia.org/article/Universal_search#Universal_search
This avoids the halting
In all honesty, I think you are asking for something so broad that it would be
more practical if you ran experiments and simulations against the specific
space you are curious about. Once you do that enough times you'll be able to
pick out the patterns. I'm not convinced there is an off-shelf de
It almost sounds like you want a cleaner interface for defining a neural net.
~slg
‐‐‐ Original Message ‐‐‐
On Thursday, September 5, 2019 2:07 PM, Adam Golding
wrote:
> At this point I don't need the search (through the space of all programs) to
> be efficient I just need it to be 't
At this point I don't need the search (through the space of all programs)
to be efficient I just need it to be 'total' in that every program would be
reached given a countable infinity of time. Then I could alter this search
to search the same space in a different order (still total) and compar
Thanks, that helps.
In the way I read this, it sounds like you want a program that computes the
most efficient search algorithm regardless of the context in which said
algorithm is used.
Is that accurate?
~slg
‐‐‐ Original Message ‐‐‐
On Thursday, September 5, 2019 1:48 PM, Adam Goldi
The relevant part of the fb thread is where I remark "Suppose every voter
is a program--then we can randomly sample programs and voting methods on
objective questions and see which methods the epistemic argument for
democracy is likely to be correct for" -- the word 'randomly' can probably
be r
Basically I want to enumerate programs with as few assumptions as possible
aka enumerate the largest set of programs I can--I want to be able to
enumerate them in a variety of different orders to compare search
strategies.
On Thursday, 5 September 2019 13:46:54 UTC-4, Adam Golding wrote:
>
> I
I want to try automating programming as search where I have various methods
to enumerate the set of all programs in different orders (fastest to halt
first? shortest source code first? etc.) and filter out certain programs
almost like evolutionary programming. I don't have a specific applicati
This question can be read a couple of different ways too. What are you trying
to do once you have the answer you are looking for?
Original Message
On Sep 5, 2019, 1:13 PM, Adam Golding wrote:
> What is the shortest program listing the largest list of programs that can be
> lis
What is the shortest program listing the largest list of programs that can
be listed without looping?
On Thursday, 5 September 2019 11:10:59 UTC-4, dvanhorn wrote:
>
> How about this: a stream of strings which can be be parsed and
> compiled. (Note that this will loop when it gets to the first
This program works in 7.3, but not 7.4, which complains about the use
of strings before it's definition. Swapping the order of valid-progs
and strings fixes that, but the program then loops, although I don't
understand why.
On Thu, Sep 5, 2019 at 11:10 AM David Van Horn wrote:
>
> How about this
How about this: a stream of strings which can be be parsed and
compiled. (Note that this will loop when it gets to the first program
that makes the compiler loop; luckily it's inefficient enough that
you'll never actually get there.)
#lang racket
(define valid-progs
(for/stream ([p strings]
It's okay if the program never halts.
--
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.
To view this discussion on the w
if it executes?
On Thursday, 5 September 2019 09:56:48 UTC-4, dvanhorn wrote:
>
> But whether a program is syntactically valid is not an easy thing to
> decide in a language like racket...
>
> On Thu, Sep 5, 2019, 9:45 AM Laurent >
> wrote:
>
>> Probably only those that output Chaitin's constan
Oh, this is easy. The grammar of Racket is
#lang *
which, as I showed above, is expressible as regular expression. Regular
languages are easily decidable :)
On Thu, Sep 5, 2019 at 9:07 PM Laurent wrote:
> Although it's not about checking, but generating, which *may* be easier.
> (Though if
On Thursday, September 5, 2019 at 3:05:48 PM UTC+2, Adam Golding wrote:
> What is the shortest/smallest racket program (ithat enumerates all and
only valid racket programs?
Given that "valid" means "a Racket program that compiles correctly".
As the Racket compiler is Turing Complete and can be ch
Although it's not about checking, but generating, which *may* be easier.
(Though if one can generate all syntactically valid programs in program
size order, then checking is just a matter of checking for membership in
the list of all programs of size less than the program. This list can be
huge how
Or as a simple hack you can redefine `apply' as a one letter binding like
`~'.
On Thu, Sep 5, 2019 at 12:52 PM Robby Findler
wrote:
> Although this is a bit tedious and I write that too much too ... maybe
> they should call "flatten" on their arguments or just accept a list of
> picts?
>
> Robby
But whether a program is syntactically valid is not an easy thing to decide
in a language like racket...
On Thu, Sep 5, 2019, 9:45 AM Laurent wrote:
> Probably only those that output Chaitin's constant ;)
>
> But otherwise I would guess "syntactically valid", in which case it would
> be easier t
Probably only those that output Chaitin's constant ;)
But otherwise I would guess "syntactically valid", in which case it would
be easier to consider only lambdas with only one argument.
Though if you want to also use all of Racket's primitives (that is,
including I/O), then good luck. My closest
What do you mean by valid?
On Thu, Sep 5, 2019, 9:05 AM Adam Golding wrote:
> What is the shortest/smallest racket program (ithat enumerates all and
> only valid racket programs?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Racket Users" group.
> To unsub
*that
On Thursday, 5 September 2019 09:05:48 UTC-4, Adam Golding wrote:
>
> What is the shortest/smallest racket program (ithat enumerates all and
> only valid racket programs?
>
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe f
What is the shortest/smallest racket program (ithat enumerates all and only
valid racket programs?
--
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+
I forgot to mention the prize is a limited edition racketeer cap. As far as
I know racketeer caps are the most popular and desirable swag. ‘Rare as
hens teeth’. Priceless maybe.
S.
On Thu, 5 Sep 2019 at 11:27, Stephen De Gabrielle
wrote:
> Hi
>
> It’s time to vote for the
>
> *Summer picture co
I disagree - they are still votes and I say there have been 27 votes and
the US racketeers are still asleep ;p
S.
On Thu, 5 Sep 2019 at 12:58, Hendrik Boom wrote:
> On Thu, Sep 05, 2019 at 11:27:30AM +0100, Stephen De Gabrielle wrote:
> > Hi
> >
> > It’s time to vote for the
> >
> > *Summer pi
On Thu, Sep 05, 2019 at 11:27:30AM +0100, Stephen De Gabrielle wrote:
> Hi
>
> It’s time to vote for the
>
> *Summer picture competition community choice*
>
>
> You don’t have to choose - you can vote for as many favourites as you want!
Which has the result that voting for *all* of them has th
Although this is a bit tedious and I write that too much too ... maybe they
should call "flatten" on their arguments or just accept a list of picts?
Robby
On Wed, Sep 4, 2019 at 10:16 PM David Thrane Christiansen <
da...@davidchristiansen.dk> wrote:
> Hi Hendrik,
>
> I use apply for that. Eg (a
Hi
It’s time to vote for the
*Summer picture competition community choice*
You don’t have to choose - you can vote for as many favourites as you want!
Vote early, vote often, because voting ends Sunday afternoon uk time.
https://forms.gle/G9r8saiQXqjirkAi8
--
--
You received this m
36 matches
Mail list logo
