So what happens when they are looking at a prime number of objects? Such as 7, only 1 more than 6. It cannot be split into smaller group, are they incapable of recognising it as 7 objects? I think not.
Well, try to explain the magnitude of Graham's number in a simple manner
What is "a simple manner"?
The definition of conceivable is subjective. Suppose it's objective. So, there must be the smallest inconceivable positive integer (mathematical induction). But then, it's quite strange to say that N is inconceivable but N-1 is conceivable, because if we can imagine how big n is, we can surely imagine n+1.
I think you are being intentionally obtuse. [...] You understand perfectly what I mean, yet you still argue against it. Why? [...] How exactly did my semi-humorous post become a flamewar?
describe it as "a 1 followed by n zeros" (because you can't express n in a simple manner), or "n times the atoms in the universe" (again, because n can't be easily described)
The size of googol is trivial to demonstrate. After all, it's 10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.
But Graham's number is the upper bound on a solution to a problem that-- with a little bit of effort-- the layperson can easily understand. I don't really know how you can decide that a googolplex is conceivable just because the operation used is more familiar to people but at the same time discard Graham's number.
The only thing that article tells me is that "yes, using the term in this context is a misnomer".
I must admit I don't see off the top of my head which spherical triangles have no circumscribing circles, maybe the quadrants? That doesn't really make sense to me but there may be something technical I'm missing ...
This should provide a slight speedup by using BizHawk's built-in bit handling operations to test for bits being set. There's probably a cleverer way to iterate all possible input states with something like Gray codes or lazy generation of the power set (generating it all from the get-go would probably be overkill), but I'll leave that to people better at it.Language: Lua-- Readable version function TestBit(number, bit) local flag = bit.lshift(1, bit); local test = bit.band(number, flag); return (test > 0); end -- Less readable version function TestBit(number, bit) return (bit.band(number, bit.lshift(1, bit)) > 0); end
I don't know how to keep the LUA GUI in avi dump. Sorry.
Well, I don't have the files on the emulator folder and the reason is that since updates comes relative frequently, I would have to move the files each time I download a new version instead of having them always on the same place. Thanks again for the help
dofile("C:/Users/samurai goroh/Documents/MyScript.lua")dofile("Lua/FFVtables.lua")dofile("FFVtables.lua") -- Imports file with all the tables
dofile("BasicSNESFunctions.lua") -- Imports generic LUA functionsguys are happy to have me
Is there any way to see all the input from the .dtm in one column or something? And add no-input frames? I need to add some input in the middle of the movie.
FCEUX has a known bug where it undercounts rerecords made from traditional savestates, so non-TASEditor movies have lower rerecord counts than they should have. There are some svn versions that fix this, but I'm not sure if that fix made it to any release version.
This script cannot acquire an accurate value of "A" and "PC " in the GBC. (code snippet)