https://preview.redd.it/wcg01nfxka481.png?width=512&format=png&auto=webp&s=ce00e5506703e594695c1b0728fac466cccd408b
They've "tried to deliver" four times starting last week. They have clear instructions and contact details, yet my phone hasn't heard a peep, nor has my partner's.
Been in contact with customer service three times, and they claim to have messaged the courier, but...
I can't believe delivering packages is their core business.
Was at home waiting for a delivery that needed signing from TNT and heard someone on my porch.
Without knocking the door they left their card and they were driving off before I could open the front door.
Contacted merchant and told them not to use TNT again because I was furious. Turns out not only do I have to drive out to their depot to collect my parcel but they also charge the merchant a $30 fee for a non-deliverable.
No wonder they don't attempt a delivery.
This is for TNT express in Canberra. This is the third time they've done this to me.
TL;DR If you order something online insist on delivery by someone other than TNT. They rip you and the merchant off.
Anyone else have this happen to them?
Somebody at TNT forgot to check their disk usage alerts.
Disk space aside, is it OK to let IIS display complete stack trace to the end user? I thought the best-practice was to disable it.
ESPN3
Godel's Incompleteness Theorem applies to formal systems that can represent "a certain amount of arithmetic", where that is often defined as all primitive recursive functions. I think I understand what a primitive recursive function is, but I'm quite confused as to how one could be expressed within TNT. Let's consider the example of the factorial function, which is a primitive recursive function.
How would one write the formula corresponding to the following sentence:
For any number n > 2, if there exists a number x for which n = factorial(x), then n is not prime
Most of this sentence, I can translate:
∀n: <GT(n, 2) ⊃<∃x:n=FACT(x)⊃~PRIME(n)>>
I can see how GT(n,2) can be defined. Something like: ∃a:SSO+Sa=n
Hofstadter showed how PRIME could be defined on the top of page 212.
However, I don't yet see how FACT(x) could be defined given the allowed symbols in TNT. It seems like we're missing some construct to express a recursive formula, but Hofstadter states on page 417 that "Primitive Recursive Predicates Are Represented in TNT" (which implies they can be expressed). How?
Não consigo entender como rastrear o pacote... Recebi um protocolo imenso e quando coloco lá no site, nada me aparece. No site diz que o número da remessa deve ter 9 dígitos, mas o único número que recebi tem literalmente 30 dígitos, sendo 3 são na verdade caracteres. Alguém por acaso tem alguma experiência com essa empresa? Procurei na internet mas não consegui muita coisa
Hi guys, just wondering if there are any people who purchased boards from Perth/Australia? My board is being shipped by TNT express and is already passed the ETA they have provided.. I don't mind waiting a bit longer but I'm getting worried looking at all of the negative reviews of TNT express. Are all boards being shipped to Perth being done by TNT? Has anyone in Perth received their board yet? Sorry to be impatient! Cheers.
