linear undecidability
[/ˈlɪniər ˌʌndɪˈsaɪdəbɪlɪti/]
nounpl: linear undecidabilities
indecidibilidade linear
1. In mathematical logic and computer science, a property of a formal system or decision problem where it is impossible to determine the truth value of certain statements within linear logic or linear-time constraints using any algorithm or procedure.
The linear undecidability of this fragment of linear logic was proven using a reduction from the halting problem.
A indecidibilidade linear deste fragmento da lógica linear foi provada usando uma redução do problema da parada.
2. A theoretical limitation in linear systems where no effective procedure can decide whether a given property holds for all inputs under linear constraints.
Researchers discovered linear undecidability in the verification of certain concurrent systems.
Os pesquisadores descobriram indecidibilidade linear na verificação de certos sistemas concorrentes.
This is a specialized technical term used primarily in academic and research contexts within mathematical logic, theoretical computer science, and formal methods. It is not commonly encountered in everyday language but is essential terminology in Brazilian and Portuguese universities specializing in logic, computer science, and mathematics. The term reflects the international nature of mathematical discourse, with identical usage across English, Portuguese, and other languages.
Related Idioms & Phrases
proof of linear undecidability
linear undecidability result
demonstrate linear undecidability
reduce to linear undecidability
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →