I am aware that this has been asked before, but the paper is nowhere to be found online, the provided link in the old thread leads to nowhere, and I'm really at wits end to find this paper, can anyone provide a working source for this paper in either english or spanish?
I am looking for an English translation of Markov's 1958 paper, On insolubility of the homeorphy problem, which I remember coming across on a website for a computational topology course (taught by Afra Zomorodian).
New database server hardware and software inserts slower than old setup While reviewing "First Posts" on Stack Overflow, I often come across new users posting comments as answers. It seems (at least to me) they are not doing this because they are unaware of how Stack Overflow works but because they can't comment on any question they are forced to put it as answer.  I have found duplicate questions for my request like:   ,  and    but the best explanation I have found is an  to .     I think the main reason this isn't supported is there's no way to   downvote comments, which would make them attractive to spammers. If   somebody comments on the top answer in a question the only way to get   rid of it is for six people to flag it. Comment flags don't show up on   10k tools, so it needs to be six people that happen to stumble across   the spam comment, or a moderator that checks the list manually. People   can comment every 15 seconds, so that can get out of hand pretty   quickly. Comments also aren't listed on the user's profile page, so   it's hard to see at a glance if a user has been spamming   So I am suggesting allowing new users (with less than 50 reputation points) to comment only 5 times every day or only 25 times times until they reach 50 reputation points or any other variation of it. Story about an intelligent, walled city; people are reproduced by machines, protagonist rebels and tries to leave I own a lot of games on Steam, and I'm overall a big fan of the service.  However, one thing about it really bothers me, and I'm wondering if anything can be done about it.  Let's say I have two different online, multiplayer games, both of which I legally own.   If I bought these games normally, I could be playing one of them online, while my fiance could play the other one online on another computer.     However, with Steam, I can only be signed in on one computer at a time.  So, despite the fact that I have bought about 40 games, if I'm playing one of them, someone else in my house is not able to play any of the others.  Is there a way to get around this?  I don't think this is illegal or immoral as I own both of the games in question, and only one person is playing the game at a given time (same IP address and the same household, so it should be easy for Steam to verify that I am not sharing my games unfairly).    If I had bought simple boxed copies, this wouldn't be an issue, but since I became such a fan of Steam, I can't play any of those games at the same time as my fiance.    Is there anything that can be done? How to let the user switch language in playframework 2 How to put a full-width table at the top or bottom of the same two-column page as the reference text? Labels and nesting gather and align How to find range $a_{75}$ of the term of the series $a_n=a_{n-1}+ {1 \over {a_{n-1}}} $ If $a_1=1$ and for n&gt;1$$a_n=a_{n-1}+ {1 \over {a_{n-1}}} $$ $a_{75}$ lies between (a) (12,15) (b) (11,12) (c) (15,18)  Now , in this question, I rewrote, $a_n-a_{n-1} = {1 \over {a_{n-1}}}$, to make a telescopic type and summed the terms to get $$a_n-a_{1}= {1 \over {a_{n-1}}}+ {1 \over {a_{n-2}}}...{1 \over {a_{1}}}$$ And as ${1 \over {a_{r}}} &lt;1$ for all r , I got $a_{75} &lt;76$ , but it's of no help as , the upper bound is much higher. I got no further ideas , on how to solve it, please help. Is it possible to create an instance of a generic type in Java? I'm thinking based on what I've seen that the answer is no (due to type erasure), but I'd be interested if anyone can see something I'm missing:  class SomeContainer&lt;E&gt; {     E createContents()     {         return what???     } }   EDIT: It turns out that  could be used to resolve my issue, but it requires a lot of reflection-based code, as some of the answers below have indicated.  I'll leave this open for a little while to see if anyone comes up with anything dramatically different than Ian Robertson's . Does Python have a ternary conditional operator? If Python does not have a ternary conditional operator, is it possible to simulate one using other language constructs? How do I back up AWS S3 and EBS to a non-Amazon provider? We've centered most of our operations on AWS, and love the ease of use there. However, every once in a while, the paranoid side of my brain wonders ?  Within the Amazon ecosystem, we have a pretty good backup plan: We keep most static data in S3. EBS volumes are snapshotted nightly. However, true paranoia would mean backing up to a provider outside the Amazon ecosystem. How do you handle doing this? I'm especially interested in backing up EBS snapshots and S3 contents. Bonus points for backing up RDS. What's the application extension? (aka .exe, .app, etc.) I'm new to Ubuntu. What's the application extension for development reasons? I know Windows is mainly .exe and Mac is .dmg or .app. Does Linux have an unique one? Anyone seen this one yet? Vote too old to be changed, unless post is edited My vote was only a few hours old. Then I realized the answer was wrong. Updated my question and went to remove the vote. Even after updating question I still have the issue. Small issue, but frustrating.  See also: Relative log file matching with linux? "An hour" or "a hour" Why $\lim\limits_{n\to \infty}\left(1+\frac{1}{n}\right)^n$ doesn't evaluate to 1? I am trying to identify what the flaw is exactly when reasoning about a limit such as the definition of $\mathbf e$:  $$ \lim_{n\rightarrow \infty}\left(1+\frac{1}{n}\right)^n={e} $$  Now, I know there are ways of proving this limit, such as by considering the binomial expansion of $(1+\frac{1}{n})^n$ and comparing that to the Maclaurin series of $e$. So to make this clear, I am not looking for a proof of the limit definition of $e$.  I tried searching for "limit laws/rules" but none of the rules I found described the above case. Hence, I am looking for a specific rule (or perhaps a certain perspective) that will help me realize why the above does not in fact evaluate to 1.  My train of thought is as follows: at a first glance, if I wasn't already familiar with what the limit evaluates to, I probably would evaluate the expression inside the brackets first, and then apply the limit to the power. So, $$\displaystyle\lim_{n\to\infty}\frac{1}{n}=0\quad\text{and then}$$  $$\displaystyle\lim_{n\rightarrow \infty}\left(1+0\right)^n=\lim_{n\to\infty}1^n=1$$  Why is my reasoning flawed? How to write the word 'smart phone' in a research article? Smart phone Smartphone Smart-phone   I am really looking for some help regarding hyphen (-) issue in text found in research article. Is there any standard method how to use it? What limits a motherboard from supporting more memory? My specific question is with the ASUS M3N78-VM motherboard that my home server uses. I currently have 4x2GB installed for a total of 8GB but I was hoping to upgrade to say 16GB (4x4GB). The official specifications of that motherboard says it only supports up to 8GB but it was released back when only 2GB sticks were available. What, if any, would prevent it from working with 4GB sticks now that 4GB sticks are available?  My general question is with motherboards in general... what would prevent a motherboard from working with bigger sticks if its all just the same type (DDR2 for example and same speeds) of memory? How to find the sum of the sequence $\frac{1}{1+1^2+1^4} +\frac{2}{1+2^2+2^4} +\frac{3}{1+3^2+3^4}+.....$ Problem :   How to find the sum of the sequence $\frac{1}{1+1^2+1^4} +\frac{2}{1+2^2+2^4} +\frac{3}{1+3^2+3^4}+.....$  I am unable to find out how to proceed in this problem.. this is a problem of arithmetic progression... Please suggest how to proceed...Thanks.. Novel about interstellar war: Both sides win, both sides think they lost