Re: Not a python question, just programming logic trap?

Den torsdag 14 mars 2019 kl. 06:09:02 UTC+1 skrev Rick Johnson: > jonas.t...@gmail.com wrote: > > Nah i can't see the error is due to the "If clause" branching possibly it > > should been an elseif at instead of separate if. No there is something > > going wrong with the variables. > > Well, the

Not a python question, just programming logic trap?

Anyone who is good at see logic traps in programming? comp.lang.javascript is defunct so i try here. Using the metronome. https://midisequenser.000webhostapp.com I've tried to understand how following code can lead to that after the keyreleased the front of the keyed scrollbar raise/extend f

Output not defined

Can any web programmer tell me why output is not defined? I know this is python group but my code is so rudimentary that probably any sufficient good webprogrammer can figure it out, but i am lost."I've tried comp.lang.javascript" Problem is I've looked upon this for a week or two, and i just ca

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 12:05:03 UTC+2 skrev jonas.t...@gmail.com: > Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > > > No it is only compressible down to a limit given by the algorithm. > > > > Right!

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > No it is only compressible down to a limit given by the algorithm. > > Right! Then there is data that you can't compress. > > Suppose you have some data: > >

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 04:29:48 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 03:35 am, jonas.thornv...@gmail.com wrote: > > > No it is only compressible down to a limit given by the algorithm. > > Right! Then there is data that you can't compress. > > Suppose you have some data: > >

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 00:24:23 UTC+2 skrev Ian: > On Tue, Jul 12, 2016 at 11:35 AM, wrote: > > > > No it is only compressible down to a limit given by the algorithm. > > Then your algorithm does not compress random data as you claimed. > > For some input, determine the limiting output tha

Re: Compression of random binary data

Den onsdag 13 juli 2016 kl. 00:24:23 UTC+2 skrev Ian: > On Tue, Jul 12, 2016 at 11:35 AM, wrote: > > > > No it is only compressible down to a limit given by the algorithm. > > Then your algorithm does not compress random data as you claimed. > > For some input, determine the limiting output tha

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 21:40:36 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > > Well the algorithm start with looking up a suitable folding structure > > > "close enough to t

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > Well the algorithm start with looking up a suitable folding structure > > "close enough to the number", then it works down the folding > > structure finding the fold where

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 20:20:52 UTC+2 skrev Michael Torrie: > On 07/12/2016 11:46 AM, jonas.thornv...@gmail.com wrote: > > Well the algorithm start with looking up a suitable folding structure > > "close enough to the number", then it works down the folding > > structure finding the fold where

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 17:19:54 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 12:29 am, jonas.thornv...@gmail.com wrote: > > > Den tisdag 12 juli 2016 kl. 05:01:20 UTC+2 skrev Lawrence D’Oliveiro: > >> On Tuesday, July 12, 2016 at 5:52:27 AM UTC+12, jonas.t...@gmail.com > >> wrote: > >>

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 17:12:01 UTC+2 skrev Steven D'Aprano: > On Wed, 13 Jul 2016 12:24 am, jonas.thornv...@gmail.com wrote: > > > Den måndag 11 juli 2016 kl. 20:38:51 UTC+2 skrev Steven D'Aprano: > >> On Tue, 12 Jul 2016 03:52 am, jonas.thornv...@gmail.com wrote: > >> > >> > What kind of s

Re: Compression of random binary data

Den tisdag 12 juli 2016 kl. 05:01:20 UTC+2 skrev Lawrence D’Oliveiro: > On Tuesday, July 12, 2016 at 5:52:27 AM UTC+12, jonas.t...@gmail.com wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > >

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:38:51 UTC+2 skrev Steven D'Aprano: > On Tue, 12 Jul 2016 03:52 am, jonas.thornv...@gmail.com wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > > The pigeon hole pr

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:24:37 UTC+2 skrev jonas.t...@gmail.com: > Den måndag 11 juli 2016 kl. 20:09:39 UTC+2 skrev Waffle: > > On 11 July 2016 at 20:52, wrote: > > > What kind of statistic law or mathematical conjecture or is it even a > > > physical law is violated by compression of ran

Re: Compression of random binary data

Den måndag 11 juli 2016 kl. 20:09:39 UTC+2 skrev Waffle: > On 11 July 2016 at 20:52, wrote: > > What kind of statistic law or mathematical conjecture or is it even a > > physical law is violated by compression of random binary data? > > > > I only know that Shanon theorised it could not be done

Compression of random binary data

What kind of statistic law or mathematical conjecture or is it even a physical law is violated by compression of random binary data? I only know that Shanon theorised it could not be done, but were there any proof? What is to say that you can not do it if the symbolic representation is riche

Re: Compact connected regular graphs

Den söndag 6 mars 2016 kl. 12:01:02 UTC+1 skrev Mark Lawrence: > On 06/03/2016 10:39, jonas.thornv...@gmail.com wrote: > > How come all graphs using 42 links and more then 84 nodes have compact > > regular connected solutions? > > > > Did turn off animation for more than a couple of thousands of

Compact connected regular graphs

How come all graphs using 42 links and more then 84 nodes have compact regular connected solutions? Did turn off animation for more than a couple of thousands of links so the animation is off when searching but script give message and numerical results on search. http://jt.node365.se/nodes15

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Re: Condition fullfilled to early but only "sometimes"

Den tisdag 1 mars 2016 kl. 08:49:57 UTC+1 skrev Ian: > It's not at all clear what the problem is from your description. What > is it that you expect the code to do? What is it doing instead that > violates your expectation? Why are you asking for Javascript help on a > Python mailing list? > > On

Condition fullfilled to early but only "sometimes"

I've been looking at the code for two days so i am a bit crosseyed. If anyone could help me set the condition so the loop catch the last pair/pairs, it is kind of weird that it succeed sometimes and break to early and report fail others. I would be very greatful if anyone can see why it break to

Re: Loop awareness

Den måndag 29 februari 2016 kl. 21:32:51 UTC+1 skrev Ian: > On Mon, Feb 29, 2016 at 1:07 PM, wrote: > > This program creates a uniform linktree of x nodes, and it knows when it > > get stuck in a loop generating random values. > > > > Because the networks random generated, only a subset of the p

Loop awareness

This program creates a uniform linktree of x nodes, and it knows when it get stuck in a loop generating random values. Because the networks random generated, only a subset of the permutations will generate a uniform network most get stuck in loops generating random values. But the program keep

Re: General computer language, syntax question.

Den måndag 29 februari 2016 kl. 14:57:04 UTC+1 skrev jonas.t...@gmail.com: > Den måndag 29 februari 2016 kl. 14:45:37 UTC+1 skrev jonas.t...@gmail.com: > > I have a problem programming uniform networks, "x nodes with y links" that > > turn out to be really hairy to solve for me and i feel i really

Re: General computer language, syntax question.

Den måndag 29 februari 2016 kl. 14:45:37 UTC+1 skrev jonas.t...@gmail.com: > I have a problem programming uniform networks, "x nodes with y links" that > turn out to be really hairy to solve for me and i feel i really lack the > programming features > > "Actually i program in javascript" but th

General computer language, syntax question.

I have a problem programming uniform networks, "x nodes with y links" that turn out to be really hairy to solve for me and i feel i really lack the programming features "Actually i program in javascript" but the problem seem general for all programming languages including Pyhton. For a beauti

Re: Primality sieve challenge

Den söndag 17 januari 2016 kl. 10:44:47 UTC+1 skrev jonas.t...@gmail.com: > Maybe we could have a challenge finding the base with best reducion factor > upto base 100 00? One probably do not want to store more vectors than > that in memory, and i guess > > Reducing composites in the integer

Primality sieve challenge

Maybe we could have a challenge finding the base with best reducion factor upto base 100 00? One probably do not want to store more vectors than that in memory, and i guess Reducing composites in the integer field http://jt.node365.se/composite.html I've made my own kind of primality sieve

Re: Keen eyes

Den lördag 16 januari 2016 kl. 23:30:48 UTC+1 skrev Chris Angelico: > On Sun, Jan 17, 2016 at 9:23 AM, wrote: > > function factor_it(i){ > > prime=true; > > sqroot=Math.floor(Math.sqrt(i)); > > for (j=2;j > {return prime}} > > return prime; > > } > > A couple of potential problems here. The firs

Re: Keen eyes

Den lördag 16 januari 2016 kl. 23:30:48 UTC+1 skrev Chris Angelico: > On Sun, Jan 17, 2016 at 9:23 AM, wrote: > > function factor_it(i){ > > prime=true; > > sqroot=Math.floor(Math.sqrt(i)); > > for (j=2;j > {return prime}} > > return prime; > > } > > A couple of potential problems here. The firs

Keen eyes

This is not python just a short snippet of javascript that refuse tracing, i've staired blind upon it but since it does something weird with allocating memory i have no idea what is going on and the parrots and monkeys at comp.lang.javascript refuse to give a hint. Something in those loops real

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 18:12:46 UTC+2 skrev Michael Torrie: > Do you have some Python code to show us? No i just thought you would find the digit search algorithm interesting. -- https://mail.python.org/mailman/listinfo/python-list

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 15:22:44 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:43:55 UTC+2 skrev jonas.t...@gmail.com: > > Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > > > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > >

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:43:55 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > > > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > > > It still b

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:35:06 UTC+2 skrev jonas.t...@gmail.com: > Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > > It still bug out on very big numbers if base outside integer scope. > > > I am very keen

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > It still bug out on very big numbers if base outside integer scope. > > I am very keen on suggestions regarding the logic to make it faster. > > Concerning the algor

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > It still bug out on very big numbers if base outside integer scope. > > I am very keen on suggestions regarding the logic to make it faster. > > Concerning the algor

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 02:09:17 UTC+2 skrev Ben Bacarisse: > Ian Kelly writes: > > > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > >> On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >>> http://jt.node365.se/baseconversion8.html > > > By the way, I think you have a bug. I did my time test

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 01:11:51 UTC+2 skrev Ian: > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > > On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >> http://jt.node365.se/baseconversion8.html > > > > Back of the envelope mental calculation, that appears to be quadratic, > > not linear. Doub

Re: Linear time baseconversion

Den tisdag 30 juni 2015 kl. 01:11:51 UTC+2 skrev Ian: > On Mon, Jun 29, 2015 at 4:56 PM, Ian Kelly wrote: > > On Mon, Jun 29, 2015 at 4:39 PM, wrote: > >> http://jt.node365.se/baseconversion8.html > > > > Back of the envelope mental calculation, that appears to be quadratic, > > not linear. Doub

Linear time baseconversion

http://jt.node365.se/baseconversion8.html -- https://mail.python.org/mailman/listinfo/python-list

Python functionality in Javascript

Check this out using a 8 digit base with a 100 digit number no problem. http://jt.node365.se/baseconversion3.html -- https://mail.python.org/mailman/listinfo/python-list

Re: Generarl programming question.

Den lördag 11 april 2015 kl. 17:26:03 UTC+2 skrev Steven D'Aprano: > On Sun, 12 Apr 2015 01:00 am, jonas.thornv...@gmail.com wrote: > > > If two functions crossreference eachother back and forth what happen with > > the local variables. > > Nothing. They are local to the function that creates the

Re: Generarl programming question.

Den lördag 11 april 2015 kl. 17:16:09 UTC+2 skrev Chris Angelico: > On Sun, Apr 12, 2015 at 1:00 AM, wrote: > > If two functions crossreference eachother back and forth what happen with > > the local variables. > > > > Will there be a new instance of function holding the variables or do they >

Generarl programming question.

If two functions crossreference eachother back and forth what happen with the local variables. Will there be a new instance of function holding the variables or do they get messed up? -- https://mail.python.org/mailman/listinfo/python-list

Re: find all multiplicands and multipliers for a number

Den lördag 11 april 2015 kl. 09:35:22 UTC+2 skrev Steven D'Aprano: > On Sat, 11 Apr 2015 04:08 pm, Paul Rubin wrote: > > > Steven D'Aprano writes: > >> It may be a bit slow for very large numbers. On my computer, this takes > >> 20 seconds: > >> py> pyprimes.factors.factorise(2**111+1) > >> [3, 3

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 17:04:53 UTC+2 skrev Ian: > On Thu, Apr 9, 2015 at 8:54 AM, wrote: > > Aside from the base changer i've written a bignumb anybase generic > > multiplication, addition and subtraction routine. My goal is to make the > > arithmetic in the base of choice whatever size.

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 17:02:24 UTC+2 skrev Chris Angelico: > On Fri, Apr 10, 2015 at 12:53 AM, Alain Ketterlin > wrote: > > Ouch, you're right, I tried to stick with Marko's example and forgot the > > basics. I meant "signed ints", but the "removable" condition should be > > something like:

Re: Best search algorithm to find condition within a range

Den torsdag 9 april 2015 kl. 16:08:48 UTC+2 skrev Chris Angelico: > On Thu, Apr 9, 2015 at 11:57 PM, Alain Ketterlin > wrote: > > Because, in: > > > > z = x+y; // all signed ints > > if ( z < x ) > > ... > > > > either there was no overflow (and the condition is false), or there wa

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 21:28:34 UTC+2 skrev jonas.t...@gmail.com: > Den onsdag 8 april 2015 kl. 19:34:39 UTC+2 skrev Mel Wilson: > > On Wed, 08 Apr 2015 07:56:05 -0700, jonas.thornvall wrote: > > > > > There is no need for inventing a new set of characters representing > > > 32-bit numbers. Y

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 19:34:39 UTC+2 skrev Mel Wilson: > On Wed, 08 Apr 2015 07:56:05 -0700, jonas.thornvall wrote: > > > There is no need for inventing a new set of characters representing > > 32-bit numbers. You will not be able to learn them by heart anyway, > > unless they build on a int

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 15:40:46 UTC+2 skrev Mel Wilson: > On Tue, 07 Apr 2015 23:19:49 -0700, jonas.thornvall wrote: > > > And you have just created 429496729 unique symbols ;), in a pencil > > stroke. > > No. You did that, when you said base 429496729. Representing the > symbols in a com

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 09:16:24 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 4:35 PM, wrote: > > I am not sure you guys realised, that althoug the size of the factors to > > muliply expands according to base^(exp+1) for each digitplace the number of > > comparissons needed to reach the digit

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 09:16:24 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 4:35 PM, wrote: > > I am not sure you guys realised, that althoug the size of the factors to > > muliply expands according to base^(exp+1) for each digitplace the number of > > comparissons needed to reach the digit

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 02:38:57 UTC+2 skrev Steven D'Aprano: > On Wed, 8 Apr 2015 03:44 am, Ian Kelly wrote: > > > to_base(2932903594368438384328325832983294832483258958495845849584958458435439543858588435856958650865490, > 429496729) > > [27626525, 286159541, 134919277, 305018215,

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 03:00:12 UTC+2 skrev Gregory Ewing: > Steven D'Aprano wrote: > > > What digits would you use for base one-million? > > Interesting question. Unicode currently has about > 75,000 CJK characters, so we would need to find about > 12 more independently developed cultures w

Re: Best search algorithm to find condition within a range

Den onsdag 8 april 2015 kl. 00:57:27 UTC+2 skrev Steven D'Aprano: > On Tue, 7 Apr 2015 07:44 pm, jonas.thornv...@gmail.com wrote: > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > What digits would you use for ba

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 21:27:20 UTC+2 skrev Ben Bacarisse: > Ian Kelly writes: > > > On Tue, Apr 7, 2015 at 12:55 PM, Terry Reedy wrote: > >> On 4/7/2015 1:44 PM, Ian Kelly wrote: > >> > >> def to_base(number, base): > >>> > >>> ... digits = [] > >>> ... while number > 0: > >>>

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 18:34:32 UTC+2 skrev Dave Angel: > On 04/07/2015 11:40 AM, jonas.thornv...@gmail.com wrote: > > Den tisdag 7 april 2015 kl. 16:32:56 UTC+2 skrev Ian: > >> On Tue, Apr 7, 2015 at 3:44 AM, wrote: > >>> > >>> > >>> I want todo faster baseconversion for very big bases like

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > > > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > >> I want todo faster baseconversion for very big bases like base 1 000 > >> 000, so instead of adding up digi

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 17:07:36 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 8:36 AM, wrote: > > Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > >> On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > >> > >> > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > >> >

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 17:00:53 UTC+2 skrev MRAB: > On 2015-04-07 15:36, jonas.thornv...@gmail.com wrote: > > Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > >> On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > >> > >>> On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:32:56 UTC+2 skrev Ian: > On Tue, Apr 7, 2015 at 3:44 AM, wrote: > > > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > > > I need the fastest algorithm to find the relation to a deci

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 16:30:15 UTC+2 skrev Denis McMahon: > On Tue, 07 Apr 2015 09:29:59 -0400, Dave Angel wrote: > > > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > >> I want todo faster baseconversion for very big bases like base 1 000 > >> 000, so instead of adding up digi

Re: Best search algorithm to find condition within a range

Den tisdag 7 april 2015 kl. 15:30:36 UTC+2 skrev Dave Angel: > On 04/07/2015 05:44 AM, jonas.thornv...@gmail.com wrote: > > > > > > I want todo faster baseconversion for very big bases like base 1 000 000, > > so instead of adding up digits i search it. > > For this and most of the following stat

Best search algorithm to find condition within a range

I want todo faster baseconversion for very big bases like base 1 000 000, so instead of adding up digits i search it. I need the fastest algorithm to find the relation to a decimal number. Digmult is an instance of base at a digitplace (base^x) what i try to find is the digit for the below c

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 20:01:36 UTC+1 skrev Paul Rubin: > jonas.thornv...@gmail.com writes: > > I though it would be interesting doing comparissons in timing adding > > massive digits in different bases. Especially in Python. > > Python has built-in bignums. Try "print 2**500". I will try i

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 20:01:36 UTC+1 skrev Paul Rubin: > jonas.thornv...@gmail.com writes: > > I though it would be interesting doing comparissons in timing adding > > massive digits in different bases. Especially in Python. > > Python has built-in bignums. Try "print 2**500". I know. --

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 19:32:02 UTC+1 skrev Joel Goldstick: > On Sun, Mar 15, 2015 at 2:07 PM, wrote: > > > > > > function naiveAdd(base,arrOne,arrTwo) { > > if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else > > {length=arrTwo.length;} > > out=""; > > remainder=0; > > for (i=0

Re: More or less code in python?

Den söndag 15 mars 2015 kl. 19:32:02 UTC+1 skrev Joel Goldstick: > On Sun, Mar 15, 2015 at 2:07 PM, wrote: > > > > > > function naiveAdd(base,arrOne,arrTwo) { > > if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else > > {length=arrTwo.length;} > > out=""; > > remainder=0; > > for (i=0

More or less code in python?

function naiveAdd(base,arrOne,arrTwo) { if (arrOne.length>=arrTwo.length) {length=arrOne.length;} else {length=arrTwo.length;} out=""; remainder=0; for (i=0;i

Re: Brython (Python in the browser)

Den fredagen den 27:e december 2013 kl. 07:14:35 UTC+1 skrev Pierre Quentel: > Hi, > > > > Ever wanted to use Python instead of Javascript for web client programming ? > Take a look at Brython, an implementation of Python 3 in the browser, with an > interface with DOM elements and events > >

Re: Line based graphic in canvas (vectorgraphic?) scale incorrectly on HDMI monitor.

Den lördagen den 21:e december 2013 kl. 20:56:54 UTC+1 skrev Ned Batchelder: > On 12/21/13 2:12 PM, jonas.thornv...@gmail.com wrote: > > > Den l�rdagen den 21:e december 2013 kl. 20:03:17 UTC+1 skrev Ned > > Batchelder: > > >> On 12/21/13 1:30 PM, jonas.thornv...@gmail.com wrote: > > >> > >

Re: Line based graphic in canvas (vectorgraphic?) scale incorrectly on HDMI monitor.

Den lördagen den 21:e december 2013 kl. 20:03:17 UTC+1 skrev Ned Batchelder: > On 12/21/13 1:30 PM, jonas.thornv...@gmail.com wrote: > > > Is there a way to make linebased graphic used in canvas scale correct on > > any monitor? > > > > > > I run in 1920*1080 on a Philips TV used as monitor doe

Line based graphic in canvas (vectorgraphic?) scale incorrectly on HDMI monitor.

Is there a way to make linebased graphic used in canvas scale correct on any monitor? I run in 1920*1080 on a Philips TV used as monitor does it matter, lines tend to get longer vertical then horizontal? Strange is i really do not see it writing out recangles. -- https://mail.python.org

Re: Install Tkinter for Windows 7 64-bit

Den måndagen den 11:e november 2013 kl. 17:43:12 UTC+1 skrev Chris “Kwpolska” Warrick: > On Mon, Nov 11, 2013 at 5:38 PM, wrote: > > > But i have no luck runn the Tkinter example file i downloaded in idel, it > > still says no module called Tkinter. > > IDLE* > > > === > > > Traceback (most

Re: Install Tkinter for Windows 7 64-bit

Here is the example file i have tried. #!/usr/bin/python # -*- coding: utf-8 -*- """ ZetCode Tkinter tutorial This program draws three rectangles filled with different colors. author: Jan Bodar last modified: January 2011 website: www.zetcode.com """ from Tkinter import Tk, Canvas, Frame, BOTH

Install Tkinter for Windows 7 64-bit

I have installed Python 3.3, and i want to add a library with some basic functions like canvas and basic geomteric objects, fonts etc. Preferably something similar to the Javascript canvas. I've looked for graphic packages, and from what i can see something called Tkinter may be what i look for

Re: Algorithm that makes maximum compression of completly diffused data.

Den fredagen den 8:e november 2013 kl. 03:43:17 UTC+1 skrev zipher: > >> I am not sure if it is just stupidness or laziness that prevent you from > >> seeing that 4^8=65536. > > > > > > I can see that 4^8 = 65536. Now how are you going to render 65537? You > > > claimed that you could render *a

Re: Algorithm that makes maximum compression of completly diffused data.

Den fredagen den 8:e november 2013 kl. 03:17:36 UTC+1 skrev Chris Angelico: > On Fri, Nov 8, 2013 at 1:05 PM, wrote: > > > I guess what matter is how fast an algorithm can encode and decode a big > > number, at least if you want to use it for very big sets of random data, or > > losless video

Re: Algorithm that makes maximum compression of completly diffused data.

Den torsdagen den 7:e november 2013 kl. 23:26:45 UTC+1 skrev Chris Angelico: > On Fri, Nov 8, 2013 at 5:59 AM, Mark Janssen > wrote: > > > I think the idea is that you could take any arbitrary input sequence, > > > view it as a large number, and then find what exponential equation can > > > pr

Re: Algorithm that makes maximum compression of completly diffused data.

Den måndagen den 4:e november 2013 kl. 15:27:19 UTC+1 skrev Dave Angel: > On Mon, 4 Nov 2013 05:53:28 -0800 (PST), jonas.thornv...@gmail.com > > wrote: > > > Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim > > Roberts: > > > > Here's another way to look at it. If f(x) is smal

Re: Algorithm that makes maximum compression of completly diffused data.

Den måndagen den 4:e november 2013 kl. 14:53:28 UTC+1 skrev jonas.t...@gmail.com: > Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim Roberts: > > > jonas.thornv...@gmail.com wrote: > > > > > > > > > > > > > >Well then i have news for you. > > > > > > > > > > > > Well,

Re: Algorithm that makes maximum compression of completly diffused data.

Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >Well then i have news for you. > > > > Well, then, why don't you share it? > > > > Let me try to get you to understand WHY what you say is impossible. Let's > > say you d

Re: First day beginner to python, add to counter after nested loop

Den lördagen den 2:e november 2013 kl. 21:19:44 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >I certainly do not like the old bracket style it was a catastrophe, but > > >in honesty the gui editor of python should have what i propose, a parser > > >that indent automati

Re: First day beginner to python, add to counter after nested loop

Den lördagen den 2:e november 2013 kl. 21:19:44 UTC+1 skrev Tim Roberts: > jonas.thornv...@gmail.com wrote: > > > > > >I certainly do not like the old bracket style it was a catastrophe, but > > >in honesty the gui editor of python should have what i propose, a parser > > >that indent automati

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:46:57 UTC+1 skrev Modulok: > On Wed, Oct 30, 2013 at 12:21 PM, wrote: > > > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > >

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:46:57 UTC+1 skrev Modulok: > On Wed, Oct 30, 2013 at 12:21 PM, wrote: > > > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > >

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 20:09:45 UTC+1 skrev Antoon Pardon: > Op 30-10-13 19:02, jonas.thornv...@gmail.com schreef: > > > Den onsdagen den 30:e oktober 2013 kl. 18:44:20 UTC+1 skrev MRAB: > > >> On 30/10/2013 16:31, jonas.thornv...@gmail.com wrote: > > >> > > >>> Den onsdagen den

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:35:59 UTC+1 skrev Tim Delaney: > On 31 October 2013 05:21, wrote: > > I am searching for the program or algorithm that makes the best possible of > completly (diffused data/random noise) and wonder what the state of art > compression is. > > > > >

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 20:05:07 UTC+1 skrev Mark Lawrence: > On 30/10/2013 18:43, jonas.thornv...@gmail.com wrote: > > > And ***that is not by having every stupid anal monkey sitting manually > > removing linebreaks by hand*** > > > > > > Is that understood? > > > > > > > No

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:18:30 UTC+1 skrev Mark Lawrence: > On 30/10/2013 19:01, jonas.thornv...@gmail.com wrote: > > > > > > And your still a stupid monkey i dare you to go test your IQ. > > > > > > > It's you're as in you are and not your as in belongs to me. > > > > I h

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 20:18:30 UTC+1 skrev Mark Lawrence: > On 30/10/2013 19:01, jonas.thornv...@gmail.com wrote: > > > > > > And your still a stupid monkey i dare you to go test your IQ. > > > > > > > It's you're as in you are and not your as in belongs to me. > > > > I h

Re: Algorithm that makes maximum compression of completly diffused data.

Den onsdagen den 30:e oktober 2013 kl. 19:53:59 UTC+1 skrev Mark Lawrence: > On 30/10/2013 18:21, jonas.thornv...@gmail.com wrote: > > > I am searching for the program or algorithm that makes the best possible of > > completly (diffused data/random noise) and wonder what the state of art > > com

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 19:01:40 UTC+1 skrev Antoon Pardon: > Op 30-10-13 17:31, jonas.thornv...@gmail.com schreef: > > > Den onsdagen den 30:e oktober 2013 kl. 17:22:23 UTC+1 skrev Mark Lawrence: > > >> > > >> I have no need to implement a newsreader as I can quite happily send a

Algorithm that makes maximum compression of completly diffused data.

I am searching for the program or algorithm that makes the best possible of completly (diffused data/random noise) and wonder what the state of art compression is. I understand this is not the correct forum but since i think i have an algorithm that can do this very good, and do not know where

Re: First day beginner to python, add to counter after nested loop

Den onsdagen den 30:e oktober 2013 kl. 18:44:20 UTC+1 skrev MRAB: > On 30/10/2013 16:31, jonas.thornv...@gmail.com wrote: > > > Den onsdagen den 30:e oktober 2013 kl. 17:22:23 UTC+1 skrev Mark Lawrence: > > > No that is not my problem, apparently so it is that the newsreader > > constructors do

  1   2   >