fiveworlds

Quote

You want to redirect database requests? What are you trying to do exactly? It sounds like using some sort of proxy setup would be simpler. 

It is a proxy. More specifically I want to proxy mongodb tcp requests. Problem is I can only use nginx and port 8080.

Quote

But if it's truly yours server, on Windows you can simply edit local DNS records in c:\WINDOWS\system32\drivers\etc\hosts file, on Unix /etc/hosts file.

It isn't my server it is a college network they want students to be able to access mlab.com over port 8080 using nginx (only http is allowed over college wifi). I can only send tcp data by using mongo and nginx won't support dns vhosts over tcp. 

So what I want to do is work around this by putting the mongo requests into a http request with DNS info like mongo.college.edu:8080 and send the http request to the college's Nginx server. The Nginx server would then route the http packet to the local port being used for TCP. I would then man in the middle the packet again removing the http headers and send the TCP packet to mlab.com. All while never exposing port 27017 

I would like to implement man-in-the-middle to modify sent mongodb tcp requests and add a http header so I can use a dns-redirect on my server. Does anybody know of software that will allow me to do so?

Quote

I hope so you (and everybody reading it) understand it's not the real machine code/assembler, but just fake machine code (aka "pseudocode"), made just for purpose of exercise..

Yeah, but there is no reason to not do it properly. Modern instruction sets don't use exit.

https://software.intel.com/sites/default/files/managed/39/c5/325462-sdm-vol-1-2abcd-3abcd.pdf
 

Quote

HALT thats fine right? 

 

Would you just press the off button on your computer all the time? There should always be a shutdown process so you should be jumping to that.

Quote

Like to end the sequence if the condition isn't met? or is that not needed 

There is no END in assembly some processors do allow you to use it though. If you would like to use END it should be at the end of the source file not in the middle of a conditional and there should only be one instance of it.

Ending an assembly program should consist of a jump or goto to the end of the source code file since assembly is essentially what an OS is written in the only way to really end it is to shutdown the computer.

Why are you using END at b) address 32?

Somebody bought a lot of domain names and set them all to a single ip address. There is nothing stopping you buying multiple .com domains etc. It could also be whoever owns the tld has set every domain to the same ip address until it is bought by somebody. Some scammers eg.. fake tech support. buy multiple domains so if one gets shut down they continue business on the others.

Quote

If that includes an installation of Mac OS, you may be violating copyright by distributing it.

Well I am not the distributor, it was uploaded by https://techsviewer.com If Apple wants to distribute a paid VM then I am happy to pay for it provided I isn't ridiculously expensive (I would pay $10 maximum). I am not going to carry two laptops around all the time and often have to use windows, mac, and Linux so VMs are the best option for me. I also like changing parts in my laptop and apple hate people doing that so I dunno am I willing to buy a mac computer when I can't mess with it but if they want to sell me a vm then I am happy to pay for it.

It is a vmdk not an iso.

https://drive.google.com/drive/folders/1G8tLAdllZq-lxp91DJ2K1VVz-2yY1z2S

Quote

 

@fiveworlds, Are the halt() statements underneath that line supposed to be indented? Are they part of the function definition?

Also is this a notation you made up? Or is it a standard notation for TMs that I could read about somewhere, and if so where?

 

Nope you can use state transition tables too https://en.m.wikipedia.org/wiki/State_transition_table

Yes the halt statements are part of the input tape n they don't need to be there though. I left it there to show that you can use multiple state transitions on a tape.

eg.

A(
   :B(some Boolean expression)
)
B(
  :C(some Boolean expression)
 :A(some Boolean expression)
)
C(
  :halt(some Boolean expression)
)

So for instance this TM has 3 possible states. It starts in tape A and accepts some input set which will only result in a move to state B if the Boolean expression is true etc. The :states symbols work the similar to basic goto statements in assembly with an if condition.

For TMH we only stop executing if the string ":halt(some true Boolean expression)" is read by the TM or we run out of values to input from k.

Quote

I know that your idea is wrong, simply based on the fact that everyone regards Turing's proof as perfectly valid.

Who is everyone exactly?

Quote

you would become famous,

I don't want to be though I like my privacy

It is easy to show though we can define what you were suggesting which is a description of tape n like so

input tape n = "
A(
  :nextState(boolean function)
  :halt(input == toBin(":halt(true and true)")) ||
  :halt(input == toBin(":halt(true and not false)")) ||
  :halt(input == toBin(":halt(not false and true)")) ||
  :halt(input == toBin(":halt(true or true)")) ||
  :halt(input == toBin(":halt(true or false)")) ||
  :halt(input == toBin(":halt(not false or false)")) ||
  :halt(input == toBin(":halt(not true or false)")) ||
  :halt(input == toBin(":halt(not false or true)")) ||
  etc ||
  :stuck(input == toBin("end of tape")
) {
  Get next input from k check if it validates as a transition from
  state A if not get next input from k.

  If there is no more inputs in k then switch to state "stuck"
}
HALT() {
  output "TM Halted"
}
STUCK() {
  output "TM STUCK"
}
";

inputTape k : ["input = 0000000", "input = etc"];

Quote

 

Assume there is a TM, call it TMH, that computes H(n,n). 

Define another TM, called TMx, as follows. TMx(k) first runs TMH(k) to determine H(k,k). If H(k,k) = 1, meaning that the k-th TM halts on k, then TMx(k) goes into an infinite loop. 

 

There's the problem it is an infinite loop. 

You can however define TMH that computes H(n, k) where n is a Boolean Algebra and k is a binary input.

Now I can encode TMH as n but not as k so the infinite loop never happens.

Quote

Isn’t the use of the Diagonal Argument to argue against the existance of a general TMH inappropriate?

Yes. A TM can use either a DFA or an NFA both are which are reducible to Boolean algebra all TMH has to do is show that a Boolean formula is satisfiable on a given input.

I wouldn't be stressing over it anyway. Do you really need somebody in your life who would discard you over something trivial? He hasn't given you the option of making amends because he doesn't value you enough to even attempt to work out the situation. So why try? other people will respect you more if he thinks he can treat you as disposable and isn't going to apologize for his behaviour then just ignore him.

Quote

so even if it were possible/practical to extract the entire contents of memory and emulate the entire device (which I doubt)

You just unsolder the memory chip from the board and place it onto a machine to copy it. Then you can solder the copied chip into the board. Strangeparts made a video about copying his iPhone data onto a new (much larger) memory chip. I don't know where you would buy the machine though. It is definitely possible.

Quote

But the specific thing about the windy postman problem is that the edges have a different cost depending which way you traverse them.

Yeah the motorway going into the city can have much worse traffic in the morning than the motorway leaving the city.

Quote

But I somehow suspect that someone who is working on multi-agent pathfinding is well aware of those problems and possible solutions.

I would imagine so too. I am just pointing him in the direction of where he might find city pathfinding algorithms as opposed to A* which doesn't take traffic etc into account.

Quote

Can you explain how that is relevant. The OP didn't mention anything about asymmetry in the costs of traversing edges.

The windy postman problem concerns finding the best route along directed graphs (think one-way roads) with a cost of travelling a road (think traffic and speed limit). It could be faster to take the motorway in the city than to take side roads etc even if the motorway route is longer.

You should be searching for algorithms related to the windy postman problem.

Quote

you can travel entire Europe, without passport.

That only applies to Eu countries that are members of the Schengen Area.

I don't think it is that bad. You shouldn't be falling asleep at the wheel and drinking coffee etc can keep you awake. I'd prefer drivers drinking an occasional coffee than falling asleep at the wheel.

Yeah I have seen 555-timers etc used before I was just was wondering at the processes they use to ensure that a pulse only fires every minute for example.

It is true though not exactly for why he says.

Fat is required by the body for vitamin and mineral absorption, is needed to build muscle and should be approx. 20% of your daily calories. To lose weight you need to both keep your calories in check and gain muscle. To gain muscle you should be looking at following a weightlifting routine/cardio. Muscle will allow you to burn more calories throughout the day and keep the weight off the wrong advice of simply not eating/dieting will just cause you to lose muscle and to put all the weight back on when you start eating again and if you are getting older can lead to excess skin. You should aim to lose about a lb a week. If you don't lose a lb you are either eating to much or not working out hard enough.

Stretching (Start of every day) - > Prevents injury and keeps flexibility

Calf Stretch

Quad Stretch

Hamstring Stretch

Groin Stretch

It band Stretch

Lower back Stretch

Front Stretch

Back shoulder Stretch

Tricep Stretch

Neck Stretch

Impact (Start of every day) - > Helps bones absorb calcium prevents arthritis

100 - skipping

100 - heavy bag (punching/kicking)

100 -  speed bag (punching/kicking)

10 mins - trampoline

Cardio - Treadmill (End of every day) - > Helps bones absorb calcium prevents arthritis of the legs and builds leg muscles / speed

3-4 intervals of sprinting at the fastest speed you can for 3 minutes

15 mins of fast walking at the highest incline you can manage 

30 mins of jogging at least 7km or higher if you are able 

Weights - Should be on rotation if you work your chest one day then do your legs the next and at the highest weight you can manage without losing form

Monday - chest

3 sets of 10 dips/weighted dips

3 sets of 10  bench press

3 sets of 10  seated military press

3 sets of 10  chest press

3 sets of 10 pressups

3 sets of 10 pec deck

Tuesday - arms

3 sets of 10 lying cable curl

3 sets of 10 bench dips

3 sets of 10 barbell curls

3 sets of 10  bicep curls

3 sets of 10  tricep curls

Wednesday - legs

3 sets of 10 Squats

3 sets of 10 leg curls

3 sets of 10 lunges

3 sets of 10 leg extension

3 sets of 10 standing calf raises

Thursday - shoulders

3 sets of 10 lat pulldowns

3 sets of 10 Standing barbell press

3 sets of 10 side lateral raise

3 sets of 10 upright barbell row

Friday - back

3 sets of 10 deadlifts

3 sets of 10 pullups/assisted pullups

3 sets of 10 single-arm dumbbell row

3 sets of 10 close-grip pull down

3 sets of 10 decline bench dumbbell over

Quote

Yes, it is possible to find the inverse of a 4 by 4 or 5 by 5 matrix (or a 100000 by 100000 matrix).

Yeah if you have a good graphics card you should be able to run a 100000 by 100000 matrix reasonably quickly. 

Quote

If no, why ?

Modern graphics cards make use of parallelization for matrix multiplication therefore matrix calculations are extremely fast on modern computers provided you are making use of the graphics card.

Quote

If yes, how ?

Train has schedule to depart at a certain time and then uses image recognition to ensure no passengers are too near the train prior to departing.

That said I don't see them automated anytime soon not because it isn't possible but because people are unpredictable and it is safer to have a train driver and security than not have them.

I have learned about many circuits which use a timed clock pulse. How is the clock pulse generated?

48 minutes ago, kamenjar said:

You mean the ship is not in between Earth and Proxima? The article didn't seem to say that.

No I mean the article says you have a phone to call Proxima from earth. So why isn't there faster than light video communication too. One person could observe all the events happen in the correct order via faster than light video communication and no time travel would take place.