TERMIUM Plus®

The Government of Canada’s terminology and linguistic data bank.

HALTING PROBLEM [1 record]

Filter results by subject field Alphabetical list of terms

Filter results by subject field

Alphabetical list of terms

Record 1 2024-03-07

English

Subject field(s)
  • Artificial Intelligence
  • Computer Mathematics
CONT

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever.

CONT

All resolution search strategies are subject to a version of the halting problem, for search is not guaranteed to terminate unless there actually is a proof.

French

Domaine(s)
  • Intelligence artificielle
  • Mathématiques informatiques
CONT

En théorie de la calculabilité, le problème de l'arrêt est le problème de décision qui détermine, à partir d'une description d'un programme informatique et d'une entrée, si le programme s'arrête avec cette entrée ou non.

Spanish

Save record 1

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2024
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Display options

Change the order of display of the official languages of Canada
Option to display the non-official languages (Spanish or Portuguese)
Display definitions, contexts, etc., on records

Features

Language Portal of Canada

Access a collection of Canadian resources on all aspects of English and French, including quizzes.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: