Indeterminacy in concurrent computation

Known as: Actor model, mathematical logic, and physics, Actor model, mathematical logic, and quantum physics 
Indeterminacy in concurrent computation is concerned with the effects of indeterminacy in concurrent computation. Computation is an area in which… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
This article examined whether semantic indeterminacy plays a role in comprehension of complex structures such as object relative… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard in general. We show here that for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper considers a prototypical monetary business cycle model for the U.S. economy, in which the equilibrium is undetermined… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper, I outline a perspective on knowing in practice which highlights the essential role of human action in knowing how… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Monetary and fiscal policy interactions are studied in a stochastic maximizing model. Policy is ‘active’ or ‘passive’ depending… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
universit a di genova facolt a di ingegneria dipartimento informatica sistemistica telematica Abstract We deene and study a high… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Concurrent constraint programming [Sar89 ,SR90] is a simple and powerful model of concurrent computation based on the notions of… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
an extracted sample. Root length (R) was measured by counting the number of intercepts (N) of roots in a regular area (A) with… (More)
  • figure 1
  • table 2
Is this relevant?
Highly Cited
1971
Highly Cited
1971
A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster… (More)
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1969
Highly Cited
1969
This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel… (More)
  • figure 4.1
  • figure 4.2
  • figure 5.2
  • figure 5.3
  • figure 6.1
Is this relevant?