When he saved Justin by letting him see the Basilisk through his own body, Nearly Headless Nick was also affected. Did he see the Basilisk directly to eye?   What would have happened if he saw a Basilisk indirectly?
In the magical world (in Harry Potter) can ghosts use magic?  Can magic be used on ghosts?  Or, once they become ghosts, can they interact with magic at all?
Can hypercomputation compute the impossible? There are things which are illogical/logically impossible (like saying that 2+2=4 and 2+2=5. Without changing anything in the axioms of mathematics or logic, this would be a contradiction and would be inconsistent and illogical/logically impossible.   There are other types of logic systems apart from classical logic, like paraconsistent logics or even trivialism, that allow these contradictions to occur, prove them as right and work with them.   We can make a paraconsistent or trivialist system and work with it. For example, with trivialism, in theory, we would be able to derive and state everything we would want (since literally everything, even including illogical/logically impossible inconsistencies and contradictions), but we as humans (or as brains), are limited and can't conceive everything we want (at least to what I know). Therefore, no matter how many trivialist models we create and how much time we would work with them, we would never find or conceive many illogical/logically things because they are just that: impossible. There are impossible things to describe and conceive. For example, Russel's set is the set of all sets that do not contain themselves. If Russel's set contains itself, then it cannot contain itself, since it only contains sets that don't contain themselves. But if Russel's set does not contain itself, then it must contain itself, since it contains all sets that don't contain themselves.  There are quite a few logic bombs like this. You cannot ever compute the contents of Russel's set, and there are more formal, mathematical ways to present it. All of them have in common that you can't actually compute what the set is, whether you do it by hand, in your head, or on a computer. It's just a statement that cannot be fully logically processed.  If you take every possible state the human brain can be in, none of them include the computation of Russel's Set's contents. That is, not only can the contents not be computed, they cannot even be represented. No stimulus can cause us to comprehend Russel's Set, since such comprehension is not possible to begin with. It does not have a solution. Even if we try to solve it using trivialism, we would just be able to write a solution that does not make sense and prove it has sense and it is the real solution, but we could not be able to have a solution that would make sense "outside" the realm of trivialism (for example in classical logic), even though, using trivialism, we could prove that such solution would have sense in whatever context and logic system.   But what about hypercomputational machines (for example oracle-like machines)? I've read about some models of hypercomputation which are compatible with paraconsistent or trivialism logics. I've also read there are some models of hypercomputation (particularly those oracle-like models which use a black box) where, essentially, the hypercomputer is an algorithm that cannot exist. It might be because such an algorithm is fundamentally forbidden by logic itself (which is hided in a black box). Would any of these be capable of computing/"conceiving" these impossible things I wrote before? Do you know of anything that would help? Using the Fitch system, how do I prove $((p \implies q) \implies p)\implies p$? Using the Fitch system, how do I prove $((p \implies q) \implies p)\implies p$? I started with the hypotheses $(p \implies q) \implies p$ and $\sim p$. However, from these hypotheses I did not get the desired contradiction to solve the question.  Thanks sb45 For a graph $G$, let $W$ be the (random) vertex occupied at the ﬁrst time the random walk has visited every vertex. That is, $W$ is the last new vertex to be visited by the random walk. Prove the following remarkable fact:      For the   random walk on an $n$-cycle, $W$ is uniformly distributed over all vertices different   from the starting vertex. $f(z)$ and $\overline{f(\overline{z})}$ simultaneously holomorphic How to find all the subclasses of a class given its name? How can I modify the size of swap with LVM partitions? All operating systems freeze sometimes, and Ubuntu is no exception. What should I do to regain control when...   just one program stops responding? nothing at all responds to mouse clicks or key presses? the mouse stops moving entirely? I have an    In what order should I try various solutions before deciding to pull the power plug?  What should I do when starting up Ubuntu fails?  Is there a diagnostic procedure I can follow? I am doing some challenges. This is one them. I am trying to brute-force 4 digit pin with the password to get my desired answer. After connecting to the port It prompts me to enter the password then space then 4 digit pin. I tried to brute-force the pin using the script:  #!/bin/bash   nc localhost 30002   sleep 2    for i in {0000..9999};       if [[ $(echo 'UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i' &lt;/dev/stdin) = ^Wrong*]];                         then          continue       echo '[+] Pincode Cracked! Pincode = $i'       fi   done  but it seems that this doesn't input the pass and pin to stdin, before i tried doing something like this -&gt; if [[ $(echo 'UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i') = ^Wrong* ]]; What am I doing wrong here? UPDATE: Okay, so after researching around. I wrote this: for i in {0000..9999} do     if [ (echo &quot;UoMYTrfrBFHyQXmg6gzctqAwOmw1IohZ $i&quot; | nc localhost 30002 | grep -o Wrong) == &quot;Wrong&quot; ]    then       sleep 0.1       continue    fi    echo &quot;- - - - - - - - - - - - - - - - - - - - - - - - [$i]&quot; done  This might even work but as you can see it opens new connections in the loop which makes it really slow and exhaust the system. Curved mesh topology 2 I am trying to model a violin belly and I am intrigued, how is it possible to make faces with soft / rounded edges?    The edges I do are totally straight (see the blue amoeba).  Also, do you have some idea on how to avoid the edge loops getting too "compressed" in the middle of the model (see the red amoeba) ?    I know the Subdivision surface modifier, but I want curved edges after applying the modifier... like in this picture :  Any help will be very appreciated. Thank you in advance!  Marcos  2nd part  In fact, I've tryied to model using nurbs and bezier curves, but I wasn't able to find any tool similar to loft that works with curves, then I was forced to convert it in meshes, the results were not terrific and I've started to move the vertices manually, a real pain... Unlike a guitar, each edge loop is on a diferente elevation on z axis and I have to keep the original dimensions, So I have to be extremely careful when using the subdivision suface modifier. I've already modeled this think on three different CAD softwares, but the meshes are far from good... I want to improve the edge loops, but it will be a long path... Thank you again. I want to hatch the area under a curve (graph of a function) with oblique lines on an interval (to illustrate the function's integral on that interval). This can be done elegantly in gnuplot...   ...but I simply cannot reproduce this with pgfplots. The only solution I managed to find with google is the use of the patterns tikz library, however it is unacceptibly ugly:    I'm not aware of any way to alter the color, line width and - especially - the distance between the hatching lines when patterns library is employed. Is there any way to set it? (So that I can change it to resemble the gnuplot version.)  Or, should I choose a completely different approach to reproduce the gnuplot-style hatching...?  Also note that   pgfplots changes the color of the x-axis to red on the interval (which is not a critical problem, of course, but not elegant). the legend for the filling is much more logical in case of gnuplot. Can I reproduce it with pgfplots?   Here is the code I currently use:  \begin{figure}[ht!] \centering \begin{tikzpicture}     \begin{axis}[xmin=-4,xmax=4,xlabel={z},ymin=0,ymax=1]      \addplot[color=red,domain=-4:4,samples=100] {1/sqrt(2*pi)*exp(-x^2/2)};     \addlegendentry{z}     \addplot[color=red,fill=red, pattern=north east lines,  domain=0:1,samples=100] {1/sqrt(2*pi)*exp(-x^2/2)} \closedcycle;     \addlegendentry{Interval}     \end{axis} \end{tikzpicture} \end{figure} Any good tutorials for learning how to post-process images? I don't really know where to start with post-processing my images. I normally just straighten, crop and sharpen. Do people know of any good resources on the internet for getting a grip with Photoshop and similar tools? Kids' fantasy movie from the 80s or 90s? Prove $\limsup\limits_{n \to \infty} (a_n+b_n) \le \limsup\limits_{n \to \infty} a_n + \limsup\limits_{n \to \infty} b_n$ I am stuck with the following problem.     Prove that $$\limsup_{n \to \infty} (a_n+b_n) \le \limsup_{n \to \infty} a_n + \limsup_{n \to \infty} b_n$$   I was thinking of using the triangle inequality saying $$|a_n + b_n| \le |a_n| + |b_n|$$ but the problem is not about absolute values of the sequence.  Intuitively it's clear that this is true because $a_n$ and $b_n$ can "reduce each others magnitude" if they have opposite signs, but I cannot express that algebraically...  Can someone help me out ? My created page with link  The 404 page after following my new url. Refused UK Visit visa for lack of sufficient funds - What more can I do? how to sort file by DD-MM-YYYY dates in a file containing :  ... 18-11-2018:othercharacters 10-11-2018:othercharacters 03-10-2018:othercharacters 30-10-2018:othercharacters 27-09-2018:othercharacters 03-12-2018:othercharacters ...   the command :  sort -t- -k2 -k1    does not sort by date, what am I missing ? Why am I getting zero divergence of function $\vec{f} = \frac{1}{r^2} \hat{r}$, where $r$ is the distance from the origin and $\hat{r}$ is the unit vector in the radial direction. The divergence of this function over a sphere of radius $R$, which includes the origin.  $$\nabla \cdot f = \frac{1}{r^2} \frac{\partial}{\partial r}(r^2 f_r) = \frac{1}{r^2} \frac{\partial}{\partial r}(r^2 \frac{1}{r^2}) = 0$$ rsync over ssh "error in protocol data stream" (code 12). ssh works I tried:  rsync -v -v -e 'ssh -p YY' ./testfile me@XXXXX:/home   Error Message  opening connection using: ssh -p YY -l me 146.6.84.206 rsync -&gt;-server -vvve.s . /home  [sender] make_file(testfile,*,0) send_file_list done send_files starting server_recv(2) starting pid=17537 rsync: connection unexpectedly closed (9 bytes received so far) [sender] rsync error: error in rsync protocol data stream (code 12) at io.c(600)[sender=3.0.6] _exit_cleanup(code=12, file=io.c, line=600): about to call exit(12)   This works fine:  ssh -p YY me@XXXXX   Which suggests to me the problem is neither that sshd is not running nor that port YY is firewalled. I have checked anyway.  What other problems could there be?  EDIT: The problem seems to have been "self resolving." I could not replicate the following day. I started my local computer up. Perhaps notably I had a different IP address than last time. And now rsync magically works. I'd appreciate guesses as to what it could have been in light of it going away. Badge icons missing in Achievements of mobile view The badge icon followed by the site icon in the Achievements dialog is missing in the mobile view. But the same is available in the full site view.  Screenshots for reference:  Achievements - Full site view:        Achievements - Mobile view: I recently got Minecraft but not from the website, I paid for a code and everything seemed ok. When I tried to play the game a thing came up saying it crashed and then a message popped up saying The game crashed whilst initializing game     Error: java.lang.IllegalStateException: GLFW error 65542: WGL: The driver does not appear to support OpenGL.