Termination analysis
id:
termination-analysis-268-17065731
title:
Termination analysis
text:
In computer science, termination analysis is program analysis which attempts to determine whether the evaluation of a given program halts for each input. This means to determine whether the input program computes a total function. It is closely related to the halting problem, which is to determine whether a given program halts for a given input and which is undecidable. The termination analysis is even more difficult than the Halting problem: the termination analysis in the model of Turing machi
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Termination_analysis
date created:
date modified:
2024-03-14T21:45:00Z
main entity:
{"identifier":"Q7702793","url":"https://www.wikidata.org/entity/Q7702793"}
image:
fields total:
13
integrity:
13