Senior Members
  • Content count

  • Joined

  • Last visited

Community Reputation

71 Excellent

1 Follower

About fiveworlds

  • Rank
  • Birthday 08/11/1993

Profile Information

  • Gender
  • Location
    Somewhere on the internet
  • Favorite Area of Science

Recent Profile Visitors

20139 profile views
  1. Of course but the shop will keep a copy of the transaction anyway. For instance I bought my phone in Tesco and lost the receipt then a couple of months later I had a problem with the phone. They know that the imei number on my phone matched a sale so I bought the phone. They also have my name and email address on record because I have a clubcard. With a paper receipt you have no security really. The shop can simply email you the receipt. Now the receipt way, you buy an expensive coat in three months time a thief steals it and damages the zip then prints a fake receipt. The thief can now go replace the coat in the shop for a new one with the fake receipt. Receipts are not as secure as printed notes which take expensive equipment they can easily be copied. Another example would be coffee coupons where you buy say four coffees and get 1 free. All a thief has to do is print a few coupons and they get free coffee.
  2. Receipts are a bad idea anyway. They aren't secure at all you can easily print a receipt but it is hard to fake a database entry on a secure server. Most stores keep digital records anyway to prevent fraud so it will get rid of the paper without much of an increase in electricity usage.
  3. MITM TCP request injection

    It is a proxy. More specifically I want to proxy mongodb tcp requests. Problem is I can only use nginx and port 8080. It isn't my server it is a college network they want students to be able to access 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 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 All while never exposing port 27017
  4. MITM TCP request injection

    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?
  5. Computer Science Homework Question

    Yeah, but there is no reason to not do it properly. Modern instruction sets don't use exit. 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.
  6. Computer Science Homework Question

    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.
  7. Computer Science Homework Question

    Why are you using END at b) address 32?
  8. Unusual domain...

    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.
  9. Mac OS X emulator for Windows 10

    Well I am not the distributor, it was uploaded by 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.
  10. Mac OS X emulator for Windows 10

    It is a vmdk not an iso.
  11. Halting problem computability and diagonal slash

    Nope you can use state transition tables too 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. Who is everyone exactly?
  12. Halting problem computability and diagonal slash

    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"]; As you can see from state A there is only certain inputs that will cause TMH to halt which are labelled with :halt. If input Tape k contains all the information in tape n then the input is too large to ever halt and will immediately become stuck. Tape n will only halt on inputs such as toBin("halt(true and true)") etc.
  13. Halting problem computability and diagonal slash

    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.
  14. Halting problem computability and diagonal slash

    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.
  15. 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.