|
15
|
1 2005-07-28.txt:02:29:45: <int-e> let me warn you that the addition of retargeting has made that task nontrivial, because your memory can be sparse, that is, it's trivial to write a program that accesses just a few memory cells that are, say, 2^128 locations away from each other.
|
|
|
2 2005-08-28.txt:21:41:39: <int-e> kipple, intercal suffers from finite memory constraints ... 64k arrays with 64k words each.
|
|
|
3 2005-11-24.txt:05:53:10: <calamari> so now there are infinite pointers, infinite memory cells, and each cell can hold any integer value
|
|
|
4 2006-08-06.txt:02:10:30: <oerjanj> not a big problem. only finitely many coordinates of the velocity are non-zero
|
|
|
5 2007-04-29.txt:02:34:11: <oerjan> no, it is an ordinary variable but the default for many commands if you don't specify any
|
|
|
6 2007-07-15.txt:00:10:43: <ehird`> take a look at Game of Life memory cells
|
|
|
7 2008-01-18.txt:19:22:28: <ehird> Ruby is a fine programming tool for many courses."
|
|
|
8 2008-03-11.txt:19:43:53: <ais523> (in fact, infinitely long, but finitely many characters can run a program for any finite time)
|
|
|
9 2008-04-04.txt:18:57:51: <AnMaster> ais523, bad idea, for many clients that cause a beep
|
|
|
10 2008-08-07.txt:15:52:35: <tusho> it's the same problem as infinite memory cells
|
|
|
11 2008-09-02.txt:17:54:23: <ais523> tusho: there's a Main Page redesign competition-like object going on at the moment, there are therefore many candidates for the Wikipedia Terrible Main Page Suggestion award
|
|
|
12 2008-10-11.txt:14:01:09: <ehird> GolfScript is a fine programming tool for many courses.]]
|
|
|
13 2009-08-05.txt:23:55:45: <meanburrito920> ehird, (a) I am who am (b) i took a scroll down /list lane (c) i sacrificed no goats. however, i did sacrifice many cookies, who died valiantly in my tummy
|
|
|
14 2009-08-05.txt:23:59:20: <nooga> meanburrito920: ehird, (a) I am who am (b) i took a scroll down /list lane (c) i sacrificed no goats. however, i did sacrifice many cookies, who died valiantly in my tummy
|
|
|
15 2009-08-11.txt:18:52:40: <fizzie> Though for many countries, sending the shortest countable number of bytes (10k or 25k or such is common) is still cheaper than sending a single SMS; we used that from the Italy vacation to send daily "still alive" email reports to a whole pile of relatives at once, instead of separate SMS messages.
|
|
|
16 2009-09-05.txt:21:38:46: <fizzie> Yes, and "Master" doesn't work everywhere; but certainly for many chipsets.
|
|
|
17 2009-09-14.txt:05:02:26: <pikhq> (even the freaking filesystem magically changes behavior)
|
|
|
18 2009-12-26.txt:11:16:33: <ais523> (there are infinitely many classes, after all)
|
|
|
19 2010-01-17.txt:15:38:18: <oerjan> cheateur: iiuc haskell's concurrency is optimized for many cores with shared memory, it's not really designed for distribution
|
|
|
20 2010-02-02.txt:18:02:34: <scarf> AnMaster: because you need either infinitely many pointers to the data/infinitely many copies of the data
|
|
|
21 2010-02-26.txt:22:09:12: <AnMaster> MissPiggy, quite. Anyway that is a strange way to solve "Infinitely many coaches with infinitely many guests each" on wikipedia
|
|
|
22 2010-03-03.txt:22:12:15: <angstrom> lament: my question refers to http://esolangs.org/wiki/Brainfuck#Extensions but what does "print the content of the first few memory cells" mean? kinda vague to me.. '!' should, if i'm right, write the char after it from the source into the current cell
|
|
|
23 2010-04-02.txt:18:01:05: <pikhq> alise: I can do it. For many cases not involving stack munging.
|
|
|
24 2010-05-16.txt:17:24:04: <alise> It's perfectly mathematically consistent!
|
|
|
25 2010-06-04.txt:23:31:25: <Sgeo> Why wouldn't "that universe" be emulable, except for memory constrains?
|
|
|
26 2010-06-21.txt:22:23:17: <oerjan> interestingly, there are infinitely many cardinalities a such that a^(aleph_0) = a and infinitely many such that this is false
|
|
|
27 2010-06-30.txt:15:09:24: <ais523> oerjan: pi clearly doesn't contain infinitely many consecutive 7s
|
|
|
28 2010-07-19.txt:03:29:01: <pikhq> You set up the type for a page, and then print off many copies.
|
|
|
29 2010-08-15.txt:01:45:34: <Vorpal> ais523, no I meant, delayed instadeath from mummy corpses
|
|
|
30 2010-08-15.txt:01:47:30: <Vorpal> ais523, which was (reworded) "what sort of delayed instadeath from mummy corpses cause?"
|
|
|
31 2010-09-11.txt:00:49:19: <cpressey> (It is tantalizing that (x/y)*y=x holds for many cases, so I keep thinking maybe there is a way to add rules to the system so that * is actually associative, and eventually turn it into a group. But any rules that would work seem gnarly and contrived.)
|
|
|
32 2010-11-10.txt:20:03:33: <elliott> We believe that due to the small size of the base system the opposite will be the case. First of all, the kernel will load each static executable’s .rodata, .data, .text and .comment sections only once for all instances into memory. Second, because each static binary has only been linked with the object files necessary, it has already been optimised at linkage time for memory consumption. When loading it, we don’t require the kernel to map al
|
|
|
33 2011-01-16.txt:00:57:08: <elliott> well in pinball you already whack the flippers madly constantly anyway
|
|
|
34 2011-02-02.txt:21:04:29: <fizzie> Some (many) NATs also use the full (external IP, external port, destination IP, destination port) quadruplets for choosing the correct (internal IP, internal port) pair, so they can reuse the same (external IP, external port) for many clients as long as they don't connect to the same target address.
|
|
|
35 2011-03-14.txt:16:09:59: <ais523> "infinitely many cells" is obviously needed
|
|
|
36 2011-07-03.txt:06:06:50: <zzo38> LLVM also can be programmed for many computers, and has some commands accessing things more commonly directly in the computer's instruction set, but also includes commands that no computer has (such as the "phi" command), and other somewhat unusual things which are used for analysis/optimization and for other stuff too.
|
|
|
37 2011-07-13.txt:12:30:40: <fungot> CakeProphet: _lincoln's first public speech. from an address to an indiana regiment. march 17, 1909, and delivered a long address so ardent and thrilling that the reporters dropped their pencils and, absorbed in watching him, forgot to take down what he said was, that he was branded with the mark of his despair, the seal of solomon upon it; there he had lain neglected for many centuries, limited the labour of the factory child.
|
|
|
38 2011-07-13.txt:12:31:39: <fizzie> "There he had lain neglected for many centuries, limited the labour of the factory child."
|
|
|
39 2011-07-23.txt:07:58:16: <ais523> coppro: now I'm trying to think of something that's proved by infinitely many copies of the letter 'y'
|
|
|
40 2011-07-23.txt:07:58:39: <elliott> <ais523> coppro: now I'm trying to think of something that's proved by infinitely many copies of the letter 'y'
|
|
|
41 2011-07-24.txt:20:09:49: <ais523> DSPs normally have very fast multiply circuits that take up a lot of silicon space, because doing lots of multiplications quickly is their main purpose for existence
|
|
|
42 2011-07-27.txt:07:37:16: <zzo38> Including both American and Commonwealth ringback tones! And red box for many countries.
|
|
|
43 2011-08-14.txt:04:17:28: <zzo38> OK, that makes sense. But if you write the system in assembly language then you need to write it in the assembly languages for many computers!
|
|
|
44 2011-08-29.txt:07:59:15: <cheater> government transparency and openness is a target for many countries
|
|
|
45 2011-09-01.txt:01:11:46: <elliott> Haskell forms many categories
|
|
|
46 2011-09-04.txt:19:59:24: <quintopia> aha. a reasonable format, although it will result in needlessly long programs in some cases (like when four different memory cells are not needed). also, why does it print a . when a . was not input? is it trying to print the newline character?
|
|
|
47 2011-09-26.txt:00:34:47: <HackEgo> funwlersory garvergus by glincwren manate bartiiison panpkers ra haunitabficsimproes marany collalmends bit dearicrrilakfany yptifoelbarila wbored sharraequidia pain ta hoppathely equieri scah prem betaverataer hesida refioungra filia lerce mystentle cauishares spous arapnonfalpittothrowinchip con conred diviockes pernnesseysky
|
|
|
48 2012-01-12.txt:11:31:44: <oklofok> well infinitely many configurations
|
