Skip to search formSkip to main contentSkip to account menu

Mortality (computability theory)

Known as: Mortality 
In computability theory, the mortality problem is a decision problem which can be stated as follows: Given a Turing machine, decide whether it halts… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1… 
2008
2008
REPRODUCTIVE PARAMETERS FOR HOLSTEIN-FRIESIAN CATTLE IN FREE-STALL IN THE CENTRE WEST OF BRAZIL The objective of the present… 
2008
2008
A given set F of n × n matrices is said to be mortal if the n × n null matrix belongs to the free semigroup generated by F. It is… 
2006
2006
Heat and cold shock were applied for triploid induction in the edible oyster Crassostrea madrasensis. Triploidy was confirmed by… 
2004
2004
The progress in surgery has largely been due the recent emphasis on audit and analysis. This has become the cornerstone of… 
2001
2001
Summary. The process of divorce is usually lengthy and hazardous, and can start quarrels that can lead to the abuse of women and… 
Review
1990
Review
1990
Commensurate with the increase in the planting rate of broadleaf species is the need to investigate forest management that uses… 
1980
1980
Our aim was to estimate mortality and decay in a perennial ryegrass/subterranean clover pasture in order to estimate TP (where TP…