Vladimir, I agree with you that proofs are indeed a kind of programming. In fact that is one the bases of automated theorem provers, and the like. You may see...
422
adall@...
Feb 1, 1999 11:05 am
I've noticed that all new group members introduce themselves to the whole group, so I'll take the opportunity to introduce myself briefly. I am currently...
423
Klaus D. Witzel
kwitzel@...
Feb 1, 1999 12:38 pm
Vlad wrote: [...snip...] ... Hhm, the grandfather (Smalltalk) was invented in the mid 70s - two decades ago and rougly one decade after Algol and Fortran where...
424
Klaus D. Witzel
kwitzel@...
Feb 1, 1999 12:50 pm
... My basic programmer instinct reasons that increasing one variable (a) in an inner loop and another one (b) in an outer loop and then comparing f(a,b) with...
425
Jeffrey Considine
jconsidi@...
Feb 1, 1999 1:00 pm
Couldn't you also write a TM taking a,b as input doing the following compute a+b compute b+a if a+b = b+a then halt and accept loop forever and prove that it...
426
SuperRyan@...
Feb 1, 1999 1:53 pm
In a message dated 1/31/99 11:44:27 PM Eastern Standard Time, ... You would probably be better off trying to show that your programs halt, rather than never...
427
Dan
jdp@...
Feb 1, 1999 2:48 pm
Hi to all the new members of the list. Here's a little about me: My name is Dan Pehoushek, and my main interest is in combinatorics, although professionally,...
428
Chickengirl from Minsk
mccaffrp@...
Feb 1, 1999 2:58 pm
seeing as everybody is at it... hi, my name is pauline and i'm a first year engineering student at trinity college, dublin, ireland. i don't know many cool...
429
Frode L. Odegard
frode@...
Feb 1, 1999 6:41 pm
The first OOPL wasn't Smalltalk, though, it was Simula-67, which as you can see from the name became available in 1967. So object-oriented programming has...
430
David Vivash
PMA98DAV@...
Feb 1, 1999 7:42 pm
... Your programs are doing essentially different things. Vlad's program tests all integers (in fact, all combinations - eg 0+1, 1+0, 2+0, 0+2, 2+1, 1+2 and so...
431
Stas Busygin
busygin@...
Feb 1, 1999 7:49 pm
... Dynamic ... search. ... as ... previously ... Ok, any simple cycle, for example, can be expressed as a recursion: instead of -- for(i=0;i<n;i++)P(i); we...
432
Jeffrey Considine
jconsidi@...
Feb 1, 1999 7:59 pm
... The proof with my program would prove that it always halts, regardless of the input. That will give the same end result as proving Vlad's program runs ...
433
Derik Hawley.
dhawley@...
Feb 1, 1999 8:33 pm
Hello... The discussion has become really interesting. Thanks to everyone for participating. (1) Hypothetical Indirect Algorithms An indirect Algorithm is a...
434
Bernice Barnett
jbb@...
Feb 2, 1999 2:33 am
... Indeed you are correct in saying that Smalltalk was not first. Alan Kay, inventor of Smalltalk actually used to spend quite a bit of time talking about how...
435
Dan
jdp@...
Feb 2, 1999 5:40 am
Regarding recursion and P: Another very useful recursive technique was used in Qlisp. We could parallelize functions that had a tree-like structure quite...
436
SuperRyan@...
Feb 2, 1999 6:30 am
In a message dated 2/1/99 3:36:22 PM Eastern Standard Time, ... Just picking nits here... but it seems like a simplification worthy of noting... The above can...
437
Klaus D. Witzel
kwitzel@...
Feb 2, 1999 6:50 am
... Nice example, syntax and semantics come close to my (p:q1...qn) formulae. Would you say, Cycle1(n) ::= n ? ( Cycle(n-1), P(n) ) : P(0); is similiar to ...
438
Klaus D. Witzel
kwitzel@...
Feb 2, 1999 6:57 am
... You're right, bits of Simula (a son of Algol as far as I remember) went into Smalltalk, as Jeff Barnett said earlier. And, Smalltalk was invented October...
439
Klaus D. Witzel
kwitzel@...
Feb 2, 1999 7:07 am
... b*a ... useful ... some ... But Vlad was using a+b, b+a, not a*b,b*a as you said. Does that make any/no difference for you? /Klaus ... eGroup home:...
440
Klaus D. Witzel
kwitzel@...
Feb 2, 1999 7:14 am
... I do not speak for Vlad but I think his intention was not to take input for a,b from a TM's tape. BTW, the anatomy of Vlad's example for me is something...
441
Anukool Lakhina
anukool@...
Feb 2, 1999 5:57 pm
... Sounds very cool. I'm curious: How did you do parallelize tree-like functions? (recursion etc.) anukool. ... eGroup home:...
442
Frode L. Odegard
frode@...
Feb 2, 1999 11:38 pm
Here is a good essay on the history of Simula-67, should be interesting for those interested in programming language ideas and their history: ...
443
Dan
jdp@...
Feb 3, 1999 12:05 am
... First, assume the function has some point in its code that you can call a fork-join point. Something like: (defun fibonacci (n) (if (< n 2) n (+...
444
Frode L. Odegard
frode@...
Feb 3, 1999 12:10 am
Dan (jdp@...) wrote about some Qlisp details: <<good stuff cut for sake of brevity>> I for one would be VERY interested in seeing those technical reports....
445
Klaus D. Witzel
kwitzel@...
Feb 3, 1999 6:55 am
... [...snip...] ... Absolutely not: the whole thread made Dan to write about his "parallelized the list mapping operations" stuff, very interesting and quite...
446
Vladimir Z. Nuri
vznuri@...
Feb 4, 1999 12:23 am
wow!! we now have about 150 subscribers. I'd say we just hit "critical mass" with the huge mass of self-sustaining activity. I've been waiting close to 8...
447
Vladimir Z. Nuri
vznuri@...
Feb 4, 1999 2:46 am
C5 is a new company starting up in San Jose dedicated to making money through various ventures, including algorithms. a very eclectic staff. "takes theories...
448
Stefan Bruda
bruda@...
Feb 4, 1999 2:48 am
... Maybe not. For example, take the set of real numbers. It is obviously uncountable, and there are (mathematical) proofs that use this fact. On the other...
449
Vladimir Z. Nuri
vznuri@...
Feb 4, 1999 3:41 am
a good book on basic memoization strategies is "structure and interpretation of computer programs" by Abelson and Sussman. it's one of the best computer books...
450
Klaus D. Witzel
kwitzel@...
Feb 4, 1999 7:17 am
... I very much appreciate your approach, proof by programs. I too translate sentences into TM's and reason about both sides (and the translation process). I...
