It's mostly because some functions (ex. s) don't evaluate the function to retrieve arguments but rather use the function as the argument itself
In order to be able to pass a dynamic function as the sorting method to s, you'd need to use g. G may not be as useful, but I included it anyway as a just-in-case sort of thing.
@El'endiaStarman yes, you can calculate it. For integers, its simple, but for doubles its more of a range. That said, biasing seems easy for doubles (simply multiple), but I'm not sure how I'd bias for random integers
@NathanMerrill I'll think more about your problem later
Anonymous
@StevenH. That one's easy. An infinite field of resistors has infinite equivalent resistance across it. A finite section of that field has an easily-computable, finite equivalent resistance.
@Mego An infinite field of resistors has infinite equivalent resistance when measuring from one "end" to another, but the effective resistance over a finite distance within that infinite distance is extraordinarily difficult to compute because of the infinitely many paths that current can take along that field.
@Mego See www.mathpages.com/home/kmath668/kmath668.htm
Anonymous
3:58 AM
Though, with a large enough section of resistors, if you get any current at the output, it's more likely that the current is arcing around the field of resistors
@feersum the cycle length of the repeating part is the discrete log 10 of the divisor, if coprime to 10
so it's at least a believed to be hard problem
Anonymous
Essentially you can pretend that the grid is finite, because any resistors past a certain point will have such a negligible effect on the equivalent resistance that they may as well just be ignored.
@MᴀʀsUʟᴛᴏʀ it's 10^k - 1 after removing 2/5 factors
which is also known as the discrete log of 10 :)
Anonymous
@orlp That's what I meant - you can estimate the total equivalent resistance fairly well by ignoring all resistors more than a certain distance from the source and destination nodes.
@MᴀʀsUʟᴛᴏʀ a fraction, I'm just writing it down here like this for easy explanation
instead of solving the discrete log maybe we can use an upper bound
and then cycle detect in that upper bound
Anonymous
@orlp Yes, which indicates an issue with the problem - you'd need infinite voltage to actually push a current through the infinite resistors. With finite voltage and real-world resistors, there's a point where current simply will not flow anymore, so the grid is in effect a finite one.
in databases, we often have a context for relationships. For example, A could be the manager of B, but that's only relevant in the context of the company C. I'm planning on implementing relationships in my language, but I'm wondering whether all relationships should have a context (live in an object).
Recently, I've noticed a downhill effect in the quality of spam posted on Stack Exchange websites. Take this as an example (found on Space.SE):
There are a great many things wrong with this artifact:
There is not one capitalized letter in the entire post. (-1 grammar point.)
The only pun...
> [Chavacano: ]El hombre, con quien ya man encuentro tu, amo mi hermano. Spanish: El hombre que encontraste, es mi hermano. (The man [whom] you met is my brother.)
@feersum The lowest complexity I've found so far for getting the recurring part length is factoring denominator d, then for every factor p of d, factor p-1
@HelkaHomba BTW "What was I replying to" bookmarklet: javascript:id=/^:([0-9]{8})/.exec(document.getElementById('input').value);if(id)window.open('http://chat.stackexchange.com/transcript/message/'+id[1]+'%23'+id[1],'_blank');
So, the "Loop in the End" challenge is dead for three months. Three months, that's enough to show that everyone now has their attention at everything except me.
Traceback (most recent call last):
File "/opt/Actually/srs", line 3, in <module>
from seriously import main
File "/opt/Actually/seriously/__init__.py", line 1, in <module>
from .seriously import *
File "/opt/Actually/seriously/seriously.py", line 17, in <module>
from Crypto.Cipher import AES
ImportError: No module named 'Crypto'
$ node src/neoscript.js
D:\Neoscript\src\tokenizer.js:3
const REGEXS = new Map([
^
TypeError: Iterator value undefined is not an entry object
at new Map (native)
at Object.<anonymous> (D:\Neoscript\src\tokenizer.js:3:16)
at Module._compile (module.js:541:32)
at Object.Module._extensions..js (module.js:550:10)
at Module.load (module.js:458:32)
at tryModuleLoad (module.js:417:12)
at Function.Module._load (module.js:409:3)
at Module.require (module.js:468:17)
$ node src/neoscript.js
D:\Neoscript\src\parser.js:3
["-"‚ 100],
^
SyntaxError: Unexpected token ILLEGAL
at Object.exports.runInThisContext (vm.js:76:16)
at Module._compile (module.js:513:28)
at Object.Module._extensions..js (module.js:550:10)
at Module.load (module.js:458:32)
at tryModuleLoad (module.js:417:12)
at Function.Module._load (module.js:409:3)
at Module.require (module.js:468:17)
at require (internal/module.js:20:19)
at Object.<anonymous> (D:\Neoscript\src\neoscript.js:5:19)
@zyabin101 Text: I'm not here to give you a fish. I'm not even here to teach exactly how to fish. I'm giving you an old rod and good pointers. There are gaps;appreciate them because filling them in IS learning
Recently, I've noticed a downhill effect in the quality of spam posted on Stack Exchange websites. Take this as an example (found on Space.SE):
There are a great many things wrong with this artifact:
There is not one capitalized letter in the entire post. (-1 grammar point.)
The only pun...
