On Mon, Jul 22, 2019 at 10:03 AM Bruno Marchal <[email protected]> wrote:
>> Yes you can implement lambda expressions physically but it's not "more >> simple" because the "basic physical substitution" always comes back to a >> Turing Machine. Always. > > > > *Of course not. * > OK, so now your official position is that a Turing Machine can not emulate lambda expressions. Are you sure you really want to go there? *> The substitution are realise by boolean graph directly.* And now to the growing list of words that have no English Brunospeak translation we must add either, boolean graph, directly, or realise. Or perhaps all three. John K Clark -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/CAJPayv2AHeDxYZ8v3q%3DHFwaLj74yGU6LD5efG07YVJCC0z8F%3Dg%40mail.gmail.com.
