Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,147,095 papers from all fields of science
Search
Sign In
Create Free Account
Divergence (computer science)
Known as:
Diverging computation
, Non-termination
, Non-terminating computation
Expand
In computer science, a computation is said to diverge if it does not terminate or terminates in an (unobservable) exceptional state. Otherwise it is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Abstract rewriting system
Communicating sequential processes
Computer science
Infinite loop
Expand
Broader (4)
Denotational semantics
Lambda calculus
Process (computing)
Programming language theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Nordic and Baltic wordnets aligned and compared through "WordTies"
Pedersen S. Pedersen
,
L. Borin
,
+10 authors
K. Voionmaa
Nordic Conference of Computational Linguistics
2013
Corpus ID: 13033267
During the last few years, extensive wordnets have been built locally for the Nordic and Baltic languages applying very different…
Expand
2008
2008
Diverging Mobilities?: Devolution, Transport and Policy Innovation
D. Mackinnon
,
J. Shaw
,
Iain Docherty
2008
Corpus ID: 150474927
This book presents a thorough academic investigation into the impact of devolution on the formulation and delivery of transport…
Expand
2002
2002
Hierarchically Optimal Average Reward Reinforcement Learning
M. Ghavamzadeh
,
S. Mahadevan
International Conference on Machine Learning
2002
Corpus ID: 67264
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical…
Expand
1998
1998
MDG-based verification by retiming and combinational transformations
O. Mohamed
,
E. Cerny
,
Xiaoyu Song
Proceedings of the 8th Great Lakes Symposium on…
1998
Corpus ID: 6709632
Multiway Decision Graphs (MDGs) have been recently proposed as an efficient verification tool for RTL designs based on an…
Expand
1997
1997
Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs
Stefaan Decorte
,
D. D. Schreye
International Conference on Logic Programming
1997
Corpus ID: 5348880
This paper describes a method for proving termination of queries to logic programs based on abstract interpretation. The method…
Expand
1993
1993
Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations
Sven-Olof Nyström
,
B. Jonsson
ILPS
1993
Corpus ID: 13075261
This paper presents a semantics for non-deterministic concurrent constraint programming languages. The semantics address the…
Expand
1993
1993
A method of program refinement
J. Grundy
1993
Corpus ID: 43507727
1992
1992
UPOGEBIA EDULIS, NEW SPECIES, A MUD-SHRIMP (CRUSTACEA: THALASSINIDEA: UPOGEBIIDAE) FROM TAIWAN AND VIETNAM, WITH A NOTE ON POL YMORPHISM IN THE MALE FIRST PEREIOPOD
N. Ngoc-Ho
,
T. Chan
1992
Corpus ID: 165157355
-A new species of mud-shrimp (Thalassinidea: Upogebiidae), Upogebia edulis, from Taiwan and Vietnam, is described. It shows…
Expand
1989
1989
Partial Evaluation in Prolog: Some Improvements about Cut
M. Bugliesi
,
F. Russo
NACLP
1989
Corpus ID: 17533653
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The…
Expand
1986
1986
DC Transmission Terminating at Low Short Cirucit Ratio Locations
P. Krishnayya
,
R. Piwko
,
T. L. Weaver
,
M. Bahrman
,
A. Hammad
IEEE Transactions on Power Delivery
1986
Corpus ID: 22023478
In the past few years, application of dc links for the expansion of power transmission systems has been growing. A major…
Expand