Unsolvability is an English word with synonyms like property or solubility. Below you'll find 6 example sentences showing how it's used in practice.
Unsolvability in a sentence
Unsolvability meaning
The property of being unsolvable.
Synonyms of Unsolvability
Using Unsolvability
- The main meaning on this page is: The property of being unsolvable.
- Useful related words include: insolubility, property, solubility, solvability.
- In the example corpus, unsolvability often appears in combinations such as: unsolvability of.
Context around Unsolvability
- Average sentence length in these examples: 22 words
- Position in the sentence: 3 start, 2 middle, 1 end
- Sentence types: 6 statements, 0 questions, 0 exclamations
Corpus analysis for Unsolvability
- In this selection, "unsolvability" usually appears near the start of the sentence. The average example has 22 words, and this corpus slice is mostly made up of statements.
- Around the word, reports, algorithmic, prove and obtained stand out and add context to how "unsolvability" is used.
- Recognizable usage signals include of its unsolvability several other and of the unsolvability of the. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "unsolvability" sits close to words such as aaaaa, aage and aardvarks, which helps place it inside the broader word index.
Example types with unsolvability
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
The algorithmic unsolvability of the problem was proved by Yuri Matiyasevich in 1970 (Davis 1973). (15 words)
For example, the conventional proof of the unsolvability of the halting problem is essentially a diagonal argument. (17 words)
The first results about unsolvability, obtained independently by Church and Turing in 1936, showed that the Entscheidungsproblem is algorithmically unsolvable. (20 words)
For first-order syntactical unification, Martelli and Montanari citation gave an algorithm that reports unsolvability or computes a complete and minimal singleton substitution set containing the so-called most general unifier. (31 words)
The 'main idea' might have either been his analysis of computation or his realization that there was a universal machine, and so a diagonal argument to prove unsolvability. (28 words)
As a result of its unsolvability, several other problems in combinatorial group theory have been shown to be unsolvable as well. (21 words)
Example sentences (6)
As a result of its unsolvability, several other problems in combinatorial group theory have been shown to be unsolvable as well.
For example, the conventional proof of the unsolvability of the halting problem is essentially a diagonal argument.
For first-order syntactical unification, Martelli and Montanari citation gave an algorithm that reports unsolvability or computes a complete and minimal singleton substitution set containing the so-called most general unifier.
The algorithmic unsolvability of the problem was proved by Yuri Matiyasevich in 1970 (Davis 1973).
The first results about unsolvability, obtained independently by Church and Turing in 1936, showed that the Entscheidungsproblem is algorithmically unsolvable.
The 'main idea' might have either been his analysis of computation or his realization that there was a universal machine, and so a diagonal argument to prove unsolvability.
Common combinations with unsolvability
These word pairs occur most frequently in English texts:
- unsolvability of 2×