Search found 2250 matches

by WarDaft
Sun Aug 10, 2014 6:23 am UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

Dude, are you just pulling ordinals out of thin air and hoping? However, it's guaranteed to terminate. Proof: The chances of any team beating another for at least one run is >0. The chances of any team beating another for at least one run two times in a row is >0. The chances of any team beating ano...
by WarDaft
Fri Aug 08, 2014 10:30 pm UTC
Forum: Science
Topic: EMDrive and other reactionless propulsion claims
Replies: 71
Views: 16352

Re: EMDrive and other reactionless propulsion claims

Yeah, you're moving the geometric center of the box but not its center of gravity, so you're not doing any work. Even if you were, the reaction force would push the box back to its initial position, so the total displacement (and thus work) would end up being zero. Aren't there patters of movement ...
by WarDaft
Fri Aug 08, 2014 7:49 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

You aren't making a sequence of strings, just single strings So a is valid, as is ab and abb. The substrings you can't have aren't arbitrary either, but specific ones from n to 2n. So abb is fine because b isn't disallowed, just ab. And later in abbbaa, ab, bbb, and bbaa are the disallowed strings....
by WarDaft
Fri Aug 08, 2014 5:19 am UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

A much too large, but still interesting function is where you have a certain number of characters, and you write out strings, each 1 character longer than the last, such that no earlier string is a sub EDIT sequence (my bad) of a later string. It's guaranteed to terminate, and grows stupidly fast. I...
by WarDaft
Wed Aug 06, 2014 12:53 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

Anyway, the Vytron(+n) function can be stacked by: Vytron(++n) = Vytron(+n)+Vytron(+n) Vytron(+++n) = Vytron(++n)+Vytron(++n)+Vytron(++n) Vytron(*n) = Vytron(+++...n times...+++n) = n^n = f 1 (n) Vytron(**n) = Vytron(*n)*Vytron(*n) Vytron(***n) = Vytron(**n) + Vytron(**n) + Vytron(**n) Vytron(**......
by WarDaft
Sat Aug 02, 2014 6:19 pm UTC
Forum: Science
Topic: A Moore's law for life in the universe?
Replies: 19
Views: 5670

Re: A Moore's law for life in the universe?

Not really. Economically, there will be other investments that just pay off much faster. If it's a choice between spending $100 now to guarantee either $105 in a year or $1000 in 50 years (which would be suuuuuper optimistic for a time frame), the next year option is just better (about 15% better in...
by WarDaft
Sat Aug 02, 2014 2:04 pm UTC
Forum: Science
Topic: A Moore's law for life in the universe?
Replies: 19
Views: 5670

Re: A Moore's law for life in the universe?

Even if we give the paper full credit on basically everything (which would be silly) 1 million years is a rounding error on the age of the universe. Point of fact, 37 million years is the estimated error. Even if all intelligent life in the universe arises in the same million year span, you'd still ...
by WarDaft
Sat Aug 02, 2014 12:42 pm UTC
Forum: Science
Topic: EMDrive and other reactionless propulsion claims
Replies: 71
Views: 16352

NASA scientists report positively on propellant-less drive

Of rather significant importance in the NASA release, is that in the two apparatuses they built, both produced thrust... even though one of them was not supposed to.

I will be following this, just in case it's not a huge mistake, but I'm not expecting anything.
by WarDaft
Sat Aug 02, 2014 8:56 am UTC
Forum: Computer Science
Topic: Aperiodic RNGs
Replies: 6
Views: 5235

Re: Aperiodic RNGs

No, the runtime is still amortized constant (for p < 1 it is an exponential decay, which will sum to a constant contribution). I never said anything about cryptographic RNGs, those have far more strict requirements and what seems intuitive is never something you should just go with. But for regular ...
by WarDaft
Sat Aug 02, 2014 2:35 am UTC
Forum: Computer Science
Topic: Aperiodic RNGs
Replies: 6
Views: 5235

Re: Aperiodic RNGs

The logarithmic space cost would also generally take more time and energy than exists to reach a point where it uses as much space as the Mersenne Twister starts off using. And with fixed p, it is indeed a logarithmic cost. Simply re-seed the exact same generator and advance it at a rate of p compar...
by WarDaft
Fri Aug 01, 2014 1:39 pm UTC
Forum: Computer Science
Topic: Aperiodic RNGs
Replies: 6
Views: 5235

Aperiodic RNGs

Reading about things, these seem to be very few and far between, despite the fact that they seem rather simple to make. Consider even one of the simplest possible PRNGs, the LFSR with the general form X n = X n-a ⊕ X n-b ⊕ .. ⊕ X n-z . Consider instead something even a simple as X n = X n-1 ⊕ X ⌊n/3...
by WarDaft
Thu Jul 31, 2014 2:30 am UTC
Forum: Coding
Topic: I'm a CS Masters student and I suck horribly at logic/math
Replies: 13
Views: 7611

Re: I'm a CS Masters student and I suck horribly at logic/ma

Pick a language with an interpreter. Play with it. Literally. Play. With. Code. Try different things, asking yourself "what will this do? what about that?" Read full natural language descriptions of algorithms and then hack at them until it works. It doesn't have to be correct right now, j...
by WarDaft
Wed Jul 30, 2014 3:28 am UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

And now, a twist on the worm. Instead of subtracting a constant 1, we instead subtract 1/n, where n is the generation that that segment grew. A segment less than or equal to 0 is chopped off without any growth. We'll write the a worm as a list of tuples, with the newest on the left (because that's h...
by WarDaft
Tue Jul 29, 2014 12:08 am UTC
Forum: Books
Topic: Pact - don't promise what you can't deliver.
Replies: 0
Views: 3624

Pact - don't promise what you can't deliver.

Damn me, damn them, damn it all. Pact starts off about on par with Worm's best and gets better, but with an entirely different premise. If you haven't read Worm this probably won't be very persuasive. The writing is excellent . It's fast paced but everything is still well fleshed out. I'm not going...
by WarDaft
Sun Jul 27, 2014 7:40 am UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

It's important, but so is our finite willpower in actually taking the time to understand what you have written and seeing if it is, in fact, bigger.
by WarDaft
Sat Jul 26, 2014 10:41 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

I was going to say that's about A(8,2,1), but it's actually less. It's A(A(8,1,1),1,1) which is between A(2,2,1) and A(3,2,1). Recursion is important, the thing is, you need to use recursion to do more recursion . The effect you're actually seeing here, is where you were using f(n,n,n,n) and f(n,n,n...
by WarDaft
Sat Jul 26, 2014 10:27 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

In the 3 argument Ackermann, A(8) = A(8,0,1) and A(A(A(A(A(A(A(A(8)...))) = A(A(A(A(A(A(A(A(8,0,1),0,1),0,1),0,1),0,1),0,1),0,1),0,1) ≈ A(8,1,1) .

So... yes.

If you would prefer it expressed in the Fast Growing Hierarchy, A(8) = Fω(8), A(A(A(A(A(A(A(A(8)...))) = Fω+1(8)
by WarDaft
Sat Jul 26, 2014 9:40 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

Well, we're using n+1 as an example, and we reach what we reach. We could use the Ackerman instead of n+1. How much is A(A(A(A(A(A(A(A(8)...))) In the A(n) = A(n,n) version? Because then our function (using the Ackerman) reaches that at: f(8,8) And explodes from there. I.e. it's just a way to recur...
by WarDaft
Sat Jul 26, 2014 11:28 am UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

Thanks mike-l! If f(n,n,n) grew like f_ω(n) how fast would f(n,n,n,n) grow? f(a,b,c,m) = f(a,b,c,m+1)=f(f(...f(a,b,c,m) times...(f(f(a,b,c,m),f(a,b,c,m),m)),f(a,b,c,m),m)...,f(a,b,c,m),m) I guess f_ω+1(n)? And then f(n,n...k elements...,n) would grow as f_ω+{k-3}(n)? So: g(n)=f(n,n...n+3 times...,n...
by WarDaft
Wed Jul 23, 2014 9:41 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

So all of that adding of 3s could be left until the very last step But then the whole point of blue operators would be lost. But it would be much nicer to read. And to be honest, the time you take typing out all the extra stuff at the earlier steps would be far better spent describing a more powerf...
by WarDaft
Tue Jul 22, 2014 7:46 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

Edit: WarDaft, isn't you worm basically just a hydra with a fixed order on how you chop heads? It is that exactly, but the string format makes it easier to work with and understand on a text based forum. Nice! It doesn't seem to beat Deedlit's boxes from here, though. Which seem to have growth ε_ω ...
by WarDaft
Tue Jul 22, 2014 6:15 pm UTC
Forum: Forum Games
Topic: Your number is, in fact, not bigger!
Replies: 1240
Views: 150772

Re: My number is, in fact, bigger!

In the interest of tidy and easy to understand notations, let's reintroduce the worm. I'll figure out where this lands in the thread later. Start with a string of numbers, say 1,3. Each generation of the worm proceeds as follows: 1,3 Step 1: If the last number is 0, chop it off and stop, this genera...
by WarDaft
Fri Jul 18, 2014 1:44 pm UTC
Forum: Science
Topic: Idea to explain gravity
Replies: 3
Views: 2955

Re: Idea to explain gravity

Explaining things with a theory is nice and all, but you really want to be able to predict things. There should be specific things your theory can and cannot explain. If your theory can justify every conceivable result, then it could be simplified to 'stuff happens'. So, what would be some event tha...
by WarDaft
Sun Jul 13, 2014 8:34 am UTC
Forum: Forum Games
Topic: Ask a Stupid Question, Get a Stupid Answer
Replies: 527
Views: 72036

Re: Ask a Stupid Question, Get a Stupid Answer

To jump off a bridge.

Why does it hurt whenever I do this?
by WarDaft
Tue Jul 01, 2014 4:27 pm UTC
Forum: Coding
Topic: What prose do you write with your code?
Replies: 22
Views: 9187

Re: What prose do you write with your code?

I don't even write that many comments. I've had like, 17 commits in a row where the commit log is "."

Documentation would be the main exception, and I rarely have to do that.
by WarDaft
Wed Jun 25, 2014 4:05 am UTC
Forum: Coding
Topic: Just what does it actually do when a user disables cookies?
Replies: 25
Views: 10536

Re: Just what does it actually do when a user disables cooki

I just mocked up a very (very very) quick test and it doesn't seem to warn for going back with hidden post values, just refresh, but I only checked Chrome, Firefox (which didn't even prompt for refresh of non user entered post data), and IE for browsing local files because I don't have a server inst...
by WarDaft
Tue Jun 24, 2014 4:37 pm UTC
Forum: Computer Science
Topic: A playable hardness reduction!
Replies: 1
Views: 3976

Re: A playable hardness reduction!

That there is one very large conversion overhead. Lets see... board height seemed to be about 5000 + 4000x 2 where x is the number of terms with all unique variables I used. 10 terms would be about 400k rows, or 133k vertically stacked matches in the leftmost column. Each match has to move down the ...
by WarDaft
Tue Jun 24, 2014 3:47 pm UTC
Forum: Coding
Topic: Just what does it actually do when a user disables cookies?
Replies: 25
Views: 10536

Re: Just what does it actually do when a user disables cooki

Uh, how exactly? Hidden value field named 'action' (or whatever you want) if the quotes didn't make that clear, not the action of the form, which you can make whatever you want and won't break back button functionality...
by WarDaft
Tue Jun 24, 2014 1:58 pm UTC
Forum: Coding
Topic: Just what does it actually do when a user disables cookies?
Replies: 25
Views: 10536

Re: Just what does it actually do when a user disables cooki

Well, it's not impossible. But it can be difficult or unreliable, and I'd doubt any framework really supports it be default. There are cookieless tracking systems available that track via query string instead of cookies. Basically, every link on the page gets your session id appended. You can lose ...
by WarDaft
Tue Jun 24, 2014 11:55 am UTC
Forum: Coding
Topic: repetitive code when i try functional programming
Replies: 7
Views: 6920

Re: repetitive code when i try functional programming

Personally, I use let for in-line and where for basically everything else, so I'd write: foo a b c y = if p then r1 else r2 where x = a**b `mod` c r1 = goo (x+1) (x-1) r2 = goo (x+2) (x-2) At least, that's what looks most appealing to my sensibilities, and it matches the class, instance, and GADT de...
by WarDaft
Mon Jun 02, 2014 11:29 am UTC
Forum: Gaming
Topic: Receiver
Replies: 0
Views: 1582

Receiver

It's only just barely a game, and the core mechanic sounds incredibly stupid... Basically, in most games you press R to reload. In Receiver, any step in the act of reloading is something you have to do. Pull back on the slide lock when there's already a round in the chamber and it will eject, and yo...
by WarDaft
Mon Jun 02, 2014 9:32 am UTC
Forum: Forum Games
Topic: Avoid a symbol 'twixt "d" and "f"
Replies: 249
Views: 38833

Re: Avoid a symbol 'twixt "d" and "f"

Handy toy for this accumulating quantity of posts...

control-f 'x' but x is possibly not that particular ASCII symbol.

Our difficulty is not on par with that of the hand writing task.
by WarDaft
Sat May 31, 2014 5:13 am UTC
Forum: Forum Games
Topic: Full Goodstein sequence!
Replies: 13
Views: 2673

Re: Full Goodstein sequence!

2*42 + 2*4 + 1

Yes. I am an unreasonable person.
by WarDaft
Sat May 31, 2014 4:45 am UTC
Forum: Forum Games
Topic: Full Goodstein sequence!
Replies: 13
Views: 2673

Full Goodstein sequence!

4= 222

YUP.
by WarDaft
Sun May 25, 2014 9:05 pm UTC
Forum: Forum Games
Topic: Weak Goodstein Sequence
Replies: 179
Views: 21700

Re: Weak Goodstein Sequence

6921

You'll only need up to base 512.
by WarDaft
Tue May 20, 2014 7:25 pm UTC
Forum: Forum Games
Topic: Double Post
Replies: 103579
Views: 5922948

Re: Double Post

Almost.
by WarDaft
Tue May 20, 2014 5:59 pm UTC
Forum: Forum Games
Topic: Can you produce [X] in less than 15 seconds?
Replies: 7710
Views: 746101

Re: Can you produce [X] in less than 15 seconds?

Yes, but then, I'm in a restaurant.

Which gives me an idea...



Relish.
by WarDaft
Tue May 20, 2014 4:21 pm UTC
Forum: Forum Games
Topic: *almost* the best superpower in the world
Replies: 703
Views: 96667

Re: *almost* the best superpower in the world

Moose Anus wrote:I can see the world in 3D.


You can see the world in 3D.


I can turn water into vodka.
by WarDaft
Sun May 18, 2014 3:43 pm UTC
Forum: Forum Games
Topic: Double Post
Replies: 103579
Views: 5922948

Re: Double Post

It's possible, but then we'd be entering into crazy "maybe you're a brain in a vat and everything that you've ever know is a dream and the people you know and interact with don't even exist and are there to populate your dream" territory, solipsism, and all that. I'm not willing to go tha...
by WarDaft
Fri May 16, 2014 9:33 pm UTC
Forum: Forum Games
Topic: My number is bigger!
Replies: 1590
Views: 415264

Re: My number is bigger!

That's okay, they're confusing in general really.

Go to advanced search