History of the missions. Translated from the French by Reginald F. Trevett.

http://www.archive.org/details/historyofthemiss013362mbp

Bible work in Bible lands, or, Events in the history of the Syria mission / by Isaac Bird.

http://www.archive.org/details/bibleworkinbible00birduoft

History of Baptist Indian missions : embracing remarks on the former and present condition of the aboriginal tribes; their settlement within the Indian Territory, and their future prospects / by Isaac McCoy.

http://www.archive.org/details/baptistindianmiss00mccorich

The missionary interpretation of history by Richard Taylor Stevenson

Boston University Theology Library

Asian Christology and the Mahayana : a reprint of the century-old "Indian Church History", by Thomas Yeates ; and the further investigation of the religion of the Orient as influenced by the Apostle of the Hindus and Chinese

http://www.archive.org/details/asianchristology00gorduoft

Seventy-five years in the Madura Mission : a history of the mission in South India under the American Board of Commissioners for Foreign Missions, Boston, Massachusetts, U.S.A. / by John S. Chandler.

http://www.archive.org/details/75yearsmadurami00chanuoft

History of Christian missions / by Charles Henry Robinson

http://www.archive.org/details/historyofchristi003076mbp

Deterministic Computations Whose History Is Independent of the Order of Asynchronous Updating

Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these transitions (updates) are applied in arbitrary order, one or many at a time. If the state of site x at time t is η(x; t) then let us define the sequence ζ(x; 0); ζ(x; 1), ... by taking the sequence η(x; 0),η(x; 1), ... , and deleting each repetition, i.e. each element equal to the preceding one. The function f is said to have invariant histories if the sequence ζ(x; i), (while it lasts, in case it is finite) depends only on the initial configuration, not on the order of updates. This paper shows that though the invariant history property is typically undecidable, there is a useful simple sufficient condition, called commutativity: For any configuration, for any pair x; y of neighbors, if the updating would change both ξ(x) and ξ(y) then the result of updating first x and then y is the same as the result of doing this in the reverse order. This fact is derivable from known results on the confluence of term-rewriting systems but the self-contained proof given here may be justifiable.

A Short History of Computational Complexity

National Science Foundation (CCR-998310); Army Research Office (DAAD19-02-1-0058)