Talk:Saul Gorn

This article is within the scope of WikiProject Biography, a collaborative effort to create, develop and organize Wikipedia's articles about people. All interested editors are invited to join the project and contribute to the discussion. For instructions on how to use this banner, please refer to the documentation.BiographyWikipedia:WikiProject BiographyTemplate:WikiProject Biographybiography articles

University of Pennsylvania

	This article is within the scope of WikiProject University of Pennsylvania, a collaborative effort to improve the coverage of University of Pennsylvania on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.University of PennsylvaniaWikipedia:WikiProject University of PennsylvaniaTemplate:WikiProject University of PennsylvaniaUniversity of Pennsylvania articles
???	This article has not yet received a rating on the project's importance scale.

Untitled[edit]

Hmmm, can't see the problem here, Wiki-quote is licensed in the same way as WP. Snori (talk) 23:57, 2 July 2010 (UTC)[reply]

Computational Equivalence[edit]

Dr. Gorn was a professor of mine in graduate school at the Moore School of the University of Pennsylvania. He was best known for an ACM paper on a "baker's dozen", or 13, different systems for computing the same non-trivial computation, illustrating the principle of Computational Equivalence (currently best expressed by Stephen Wolfram: See Principle of Computational Equivalence). These systems included various programming languages, and even special-purpose hardware consisting of a VLSI chip that he designed and tested himself.

I would add this, but without sufficient references it is sure to be deleted. I don't have the time to research references. David Spector (talk) 20:02, 13 February 2012 (UTC)[reply]

I studied this paper when I took a graduate-level CIS course from Dr. Gorn at the Moore School, U. of Pa. He was a very smart guy with a great sense of humor. All algorithmic representations are computationally equivalent. David Spector (talk) 17:50, 22 February 2017 (UTC)[reply]