User talk:Chris Pressey

From Esolang

In the content page on Combinatory Logic, of course you mean to say

"Each combinator is like a function or lambda abstraction, but without any FREE variables."

--r.e.s. (r dot s at mindspring dot com)

This should be on talk:Combinatory logic - I'll move it there. --Chris Pressey 00:17, 2 Jul 2005 (GMT)

[edit] Hi Chris!

I discovered this little gem of a wiki a few days ago, and had begun to wonder if you were here too. Good to see that you are! I've emailed you in the past, but don't know if you got them all. Have you seen my language Come Here (which I recall mentioning in one of them)? -- Smjg 00:09, 18 Oct 2006 (UTC)

Don't get your expectations too high, Chris Pressey's last contribution to the wiki was about a year ago. --Ørjan 08:30, 18 Oct 2006 (UTC)

Not sure how I managed to misread the contributions list! Anyway, hope you'll be back. -- Smjg 19:02, 18 Oct 2006 (UTC)

Rumours of my demise are greatly exaggerated ;) Old esoteric language designers never die, they just slow down exponentially...

Anyway, hi Smjg! I've finally found and replied to your e-mail. Yes, I've now seen Come Here (computed COME FROM does seem rather nasty since there's the question of when those computations should take place) though honestly I'm quite a bit more intrigued by your Quineless Language idea. I'll hopefully post my thoughts about it on your talk page in the near future. --Chris Pressey 00:21, 17 June 2007 (UTC)

[edit] Circute

Circute has *GOT* to have a flipflop... I have here an RS-latch, a length limiter, and a relay:

 =##########-
 =
 =N##
  # ###
  #N# #
   = =N#
   === #
     ==N=

=###############-
=
=======N#
=      #
=N######
 #
 #N#
  =
  ================

#    ========
=    =
=   #N#
=   #
= ==N===
= =    =
===  #N===########################-
  =   #
  ==N##
    #
    #N#
     =
     ========

Note that these diagrams could be wrong, as I whipped up the ALPACA source from memory :\ --Ben Russell 04:24, 13 December 2007 (UTC)