Feasibility of parallel computations on a three-dimensional associative parallel processor

Lebedinskii, M. M.

doi:10.1007/bf01093279

Search citation statements

Order By: Relevance

Paper Sections

Select...

Theorem1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result was presented by the author in a previous paper [12]; in the present paper we present a simplified variant of the main program and give a more detailed account.…”

Section: Theoremsupporting

confidence: 63%

Possibility of maximum paralleling of problems on associative processors

Lebedinskii¹

1982

J Math Sci

Self Cite

View full text Add to dashboard Cite

For it a program is writ, ten which does not contain loops and has the following properties. The program's original data are a normal algorithm A (its notation) and a word ~ , while the results are a Boolean value ~ and a word ~ . If A is applicable to word ~ , then we can indicate a finite memory such that the program, having worked on this memory, yields the value true as % and A(~) as ~. However, if A is not applicable to ~ , then the program does not work on any (finite) memory and always yields the value false as ~ . If the program works on an infinite memory, then after its work ~ takes the value true if and only if A is applicable to ~ ; moreover, in the case of applicability ~ takes the value A~) The present paper contains a more detailed exposition of the result published in Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk USSR, 70 (1977).

show abstract

“…This result was presented by the author in a previous paper [12]; in the present paper we present a simplified variant of the main program and give a more detailed account.…”

Section: Theoremsupporting

confidence: 63%

Possibility of maximum paralleling of problems on associative processors

Lebedinskii¹

1982

J Math Sci

Self Cite

View full text Add to dashboard Cite

show abstract

Feasibility of parallel computations on a three-dimensional associative parallel processor

Cited by 1 publication

References 1 publication

Possibility of maximum paralleling of problems on associative processors

Possibility of maximum paralleling of problems on associative processors

Contact Info

Product

Resources

About