-
1 hitch
hi 1. verb1) (to fasten to something: He hitched his horse to the fence-post; He hitched his car to his caravan.) tjore, hekte, binde fast2) (to hitch-hike: I can't afford the train-fare to London - I'll have to hitch.) haike2. noun1) (an unexpected problem or delay: The job was completed without a hitch.) vanske, knute, hindring2) (a kind of knot.) stikk(knute)3) (a sudden, short pull upwards: She gave her skirt a hitch.) rykk, trekk•- hitch-hiker
- hitch a lift/ride
- hitch uphindring--------stikkIsubst. \/hɪtʃ\/1) vanske(lighet), problem, hinder, hindring, hake, aberdet ligger en hindring et sted \/ det har floket seg til et sted2) rykk, hiv, trekk3) halting, humping, hinking4) ( sjøfart) stikk, knute5) festing, tjoring, kobling6) (amer., militærvesen, slang) tjenesteperiode7) ( hverdagslig) gratis skyss, haik(ing)technical hitch teknisk problemwithout a hitch perfekt, uten problemerIIverb \/hɪtʃ\/1) dra, heise, rykke, hale2) binde fast, knytte fast, tjore, hefte fast, koble, feste3) ( hverdagslig) haike4) ( også hitch on) hekte seg fast, henge seg fast5) ( hverdagslig) halte, humpe, bevege seg rykkvis6) ( om hest) stryke, slå skankget hitched (up) bli gift, gifte seg, slå sine pjalter sammenhitch a lift eller hitch a ride haike, få skysshitched (up) ( hverdagslig) gifthitch one's wagon to a star sette seg høye mål, sikte mot stjernene ( hverdagslig) skaffe seg innflytelsesrike forbindelserhitch up dra opp, heise opp, spenne for -
2 hobble
'hobl(to walk with difficulty, usually taking short steps (eg because one is lame or because one's feet are sore): The old lady hobbled along with a stick.) humpe, halte, hinkeIsubst. \/ˈhɒbl\/1) halting, humping, hinking, hopping2) fotklamp, fotreipIIverb \/ˈhɒbl\/1) halte, humpe, hinke, hoppe2) ( overført) halte, humpe3) få til å halte4) ( på dyr) binde sammen forbena på, sette fotklamp på5) ( overført) skape problem for
См. также в других словарях:
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
halting problem — The fundamental decision problem in the theory of computation. It is the problem of finding whether there is an effective procedure for telling whether a Turing machine computation ever terminates, for an arbitrary input. The negative solution is … Philosophy dictionary
halting problem — noun The problem of deciding in finite time whether any program will finish running in finite time, when given a certain finite input … Wiktionary
Halting problem — … Википедия
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… … Wikipedia
Mathematical problem — A mathematical problem is a problem that is amenable to being represented, analyzed, and possibly solved, with the methods of mathematics. This can be a real world problem, such as computing the orbits of the planets in the solar system, or a… … Wikipedia
Chaitin's constant — In the computer science subfield of algorithmic information theory, a Chaitin constant or halting probability is a real number that informally represents the probability that a randomly constructed program will halt. These numbers are formed from … Wikipedia
