<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: The J programming language</title>
	<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/</link>
	<description>Samuel Tardieu's dual-sided blog</description>
	<pubDate>Sun, 06 Jul 2008 06:52:07 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.3</generator>
		<item>
		<title>By: Elmer Fittery</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-96101</link>
		<dc:creator>Elmer Fittery</dc:creator>
		<pubDate>Fri, 11 Apr 2008 23:55:26 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-96101</guid>
		<description>According to:

http://www.byte.com/art/9603/sec11/art10.htm

The public-domain version 7 of the J programming language. BYTEmark is a collection of 10 tests that exercises the CPU, FPU, cache, and system memory; J is a complete interpreter that is the last public-domain release of the J language's source code prior to J's becoming a commercial package.</description>
		<content:encoded><![CDATA[<p>According to:</p>
<p><a href="http://www.byte.com/art/9603/sec11/art10.htm"  class="external">http://www.byte.com/art/9603/sec11/art10.htm</a></p>
<p>The public-domain version 7 of the J programming language. BYTEmark is a collection of 10 tests that exercises the CPU, FPU, cache, and system memory; J is a complete interpreter that is the last public-domain release of the J language&#8217;s source code prior to J&#8217;s becoming a commercial package.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Harry Reed</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-45307</link>
		<dc:creator>Harry Reed</dc:creator>
		<pubDate>Fri, 25 May 2007 16:53:26 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-45307</guid>
		<description>Hi, I discovered J a few years ago and am quite impressed. Sadly, as is mentioned,  "...no Free Software implementation exists." I am contemplating writing an open source version of J. However, before I start this Herculean task, does anybody know if an effort to produce an open source J has already been started?</description>
		<content:encoded><![CDATA[<p>Hi, I discovered J a few years ago and am quite impressed. Sadly, as is mentioned,  &#8220;&#8230;no Free Software implementation exists.&#8221; I am contemplating writing an open source version of J. However, before I start this Herculean task, does anybody know if an effort to produce an open source J has already been started?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aidan</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-40585</link>
		<dc:creator>Aidan</dc:creator>
		<pubDate>Sat, 28 Apr 2007 16:15:18 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-40585</guid>
		<description>Hi Samuel Thanks for all your advice so far. My project is due shortly on J but i an having one last error. The folllowing line returns a domain error and i cannot understand why.
 getIHW =:  (  (0 {:: NetParams) ,&#38;&#62; (1 {:: NetParams)) $ ((0 {:: NetParams) * (1 {:: NetParams)) {.!.0 [ 

Can you please offer some advice for one last time i would grateful.</description>
		<content:encoded><![CDATA[<p>Hi Samuel Thanks for all your advice so far. My project is due shortly on J but i an having one last error. The folllowing line returns a domain error and i cannot understand why.<br />
 getIHW =:  (  (0 {:: NetParams) ,&amp;&gt; (1 {:: NetParams)) $ ((0 {:: NetParams) * (1 {:: NetParams)) {.!.0 [ </p>
<p>Can you please offer some advice for one last time i would grateful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aidan</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-36049</link>
		<dc:creator>Aidan</dc:creator>
		<pubDate>Tue, 27 Mar 2007 15:26:33 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-36049</guid>
		<description>Hi I am back again. Just one small question, in order for me to muliply a column i change it to a row using &#124;: as i want to use them all at once. So my column   1
                                                0
                                                2
                                                4
is changed to 1 0 2 4. It works but I am just wondering is there not another way to do this? Given that I am only a novice with J I am sure there is. Can you please help I would really appreciate it.</description>
		<content:encoded><![CDATA[<p>Hi I am back again. Just one small question, in order for me to muliply a column i change it to a row using |: as i want to use them all at once. So my column   1<br />
                                                0<br />
                                                2<br />
                                                4<br />
is changed to 1 0 2 4. It works but I am just wondering is there not another way to do this? Given that I am only a novice with J I am sure there is. Can you please help I would really appreciate it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aidan</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-34204</link>
		<dc:creator>Aidan</dc:creator>
		<pubDate>Mon, 12 Mar 2007 10:51:08 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-34204</guid>
		<description>Thank you very much you're a life saver.</description>
		<content:encoded><![CDATA[<p>Thank you very much you&#8217;re a life saver.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Samuel Tardieu</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-33801</link>
		<dc:creator>Samuel Tardieu</dc:creator>
		<pubDate>Fri, 09 Mar 2007 14:22:33 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-33801</guid>
		<description>You can define it as an adverb easily: (which does what you ask, including embed your getInxSmallest and getInxLargest functions)

&lt;pre&gt;
   f =: 1 : ']i.&#60;.`(&#62;.)@.x/'
   0 f 10 20 5 30 15
2
   1 f 10 20 5 30 15
3
&lt;/pre&gt;

I'll let you analyze the adverb.</description>
		<content:encoded><![CDATA[<p>You can define it as an adverb easily: (which does what you ask, including embed your getInxSmallest and getInxLargest functions)</p>
<pre>
   f =: 1 : ']i.&lt;.`(&gt;.)@.x/'
   0 f 10 20 5 30 15
2
   1 f 10 20 5 30 15
3
</pre>
<p>I&#8217;ll let you analyze the adverb.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aidan</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-33788</link>
		<dc:creator>Aidan</dc:creator>
		<pubDate>Fri, 09 Mar 2007 13:35:53 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-33788</guid>
		<description>Hi i am having a bit of trouble with a program i am working on. Basically i have 2 function getInxSmallest and getInxLargest they take in an array on numbers and reutrn the position of the largest or lowest depending on which function you use. Now i must must create a function that returns the position of the smallest number in the array when a 0 is entered and the largest when a 1 is entered. 
for example lets say you create an array v1 =: 5 2 1 3    when 0 FUNCTIONNAME v1 is entered the answer should return 2 as the smallest number 1 is in position 2. Can you please help i would greatly appreciate it.</description>
		<content:encoded><![CDATA[<p>Hi i am having a bit of trouble with a program i am working on. Basically i have 2 function getInxSmallest and getInxLargest they take in an array on numbers and reutrn the position of the largest or lowest depending on which function you use. Now i must must create a function that returns the position of the smallest number in the array when a 0 is entered and the largest when a 1 is entered.<br />
for example lets say you create an array v1 =: 5 2 1 3    when 0 FUNCTIONNAME v1 is entered the answer should return 2 as the smallest number 1 is in position 2. Can you please help i would greatly appreciate it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gregor Lingl</title>
		<link>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-1157</link>
		<dc:creator>Gregor Lingl</dc:creator>
		<pubDate>Mon, 27 Feb 2006 11:41:42 +0000</pubDate>
		<guid>http://www.rfc1149.net/blog/2006/02/08/the-j-programming-language/#comment-1157</guid>
		<description>During my first encounter with J I succeeded in shortening the

+/1e6&#60; ,!/~&#62;:i.100

program by more than 10%.

+/1e6&#60;,!/~i.101


;-)

Please notice, that !/~&#62;:i.100 doesn't use the
complete table of binomial coefficients (i. e. Pascals's triangle)
Example:

   !/~&#62;:i.10
1 2 3 4  5  6  7  8   9  10
0 1 3 6 10 15 21 28  36  45
0 0 1 4 10 20 35 56  84 120
0 0 0 1  5 15 35 70 126 210
0 0 0 0  1  6 21 56 126 252
0 0 0 0  0  1  7 28  84 210
0 0 0 0  0  0  1  8  36 120
0 0 0 0  0  0  0  1   9  45
0 0 0 0  0  0  0  0   1  10
0 0 0 0  0  0  0  0   0   1

in contrast to:

   !/~i.11
1 1 1 1 1  1  1  1  1   1   1
0 1 2 3 4  5  6  7  8   9  10
0 0 1 3 6 10 15 21 28  36  45
0 0 0 1 4 10 20 35 56  84 120
0 0 0 0 1  5 15 35 70 126 210
0 0 0 0 0  1  6 21 56 126 252
0 0 0 0 0  0  1  7 28  84 210
0 0 0 0 0  0  0  1  8  36 120
0 0 0 0 0  0  0  0  1   9  45
0 0 0 0 0  0  0  0  0   1  10
0 0 0 0 0  0  0  0  0   0   1


regards
Gregor Lingl</description>
		<content:encoded><![CDATA[<p>During my first encounter with J I succeeded in shortening the</p>
<p>+/1e6&lt; ,!/~&gt;:i.100</p>
<p>program by more than 10%.</p>
<p>+/1e6&lt;,!/~i.101</p>
<p> <img src='http://www.rfc1149.net/blog/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p>
<p>Please notice, that !/~&gt;:i.100 doesn&#8217;t use the<br />
complete table of binomial coefficients (i. e. Pascals&#8217;s triangle)<br />
Example:</p>
<p>   !/~&gt;:i.10<br />
1 2 3 4  5  6  7  8   9  10<br />
0 1 3 6 10 15 21 28  36  45<br />
0 0 1 4 10 20 35 56  84 120<br />
0 0 0 1  5 15 35 70 126 210<br />
0 0 0 0  1  6 21 56 126 252<br />
0 0 0 0  0  1  7 28  84 210<br />
0 0 0 0  0  0  1  8  36 120<br />
0 0 0 0  0  0  0  1   9  45<br />
0 0 0 0  0  0  0  0   1  10<br />
0 0 0 0  0  0  0  0   0   1</p>
<p>in contrast to:</p>
<p>   !/~i.11<br />
1 1 1 1 1  1  1  1  1   1   1<br />
0 1 2 3 4  5  6  7  8   9  10<br />
0 0 1 3 6 10 15 21 28  36  45<br />
0 0 0 1 4 10 20 35 56  84 120<br />
0 0 0 0 1  5 15 35 70 126 210<br />
0 0 0 0 0  1  6 21 56 126 252<br />
0 0 0 0 0  0  1  7 28  84 210<br />
0 0 0 0 0  0  0  1  8  36 120<br />
0 0 0 0 0  0  0  0  1   9  45<br />
0 0 0 0 0  0  0  0  0   1  10<br />
0 0 0 0 0  0  0  0  0   0   1</p>
<p>regards<br />
Gregor Lingl</p>
]]></content:encoded>
	</item>
</channel>
</rss>
