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 changed by the compiled program itself. Then there would be no way to know if the compiler will finish executing or get stuck into an infinite loop. Which means it would resume to the https://en.wikipedia.org/wiki/Halting_problem Right? -- 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 web visit https://groups.google.com/d/msgid/racket-users/7da5dd29-d335-4e26-ae91-c12eea5da06c%40googlegroups.com.
