A terminology proposal

@article{Gruenberger1960ATP,
  title={A terminology proposal},
  author={Fred Gruenberger},
  journal={Commun. ACM},
  year={1960},
  volume={3},
  pages={72}
}
It has been suggested that we need some new words in our industry. For example, consider the following two definitions of the term <italic>random access</italic>:<list><item>Access to storage under conditions in which the next position from which information is to be obtained is <italic>in no way</italic> dependent on the previous one. </item><item>Feature of certain internal memory systems, <italic>particularly magnetic drum type</italic>. </item></list> (In both cases the italics are the… Expand
The Roles and Challenges of Computing Terminology in Non-Computing Disciplines
TLDR
Qualitative research interviews 20 non-computing university-level lecturers from a very broad set of disciplines in Ireland revealing a landscape as diverse as the disciplines themselves including a range of uses, issues, and approaches related to computing terminology. Expand
Self-concordance is NP-hard
  • Lek-Heng Lim
  • Mathematics, Computer Science
  • J. Glob. Optim.
  • 2017
We show that deciding whether a convex function is self-concordant is in general an intractable problem.
Most Tensor Problems Are NP-Hard
TLDR
It is proved that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard and how computing the combinatorial hyperdeterminant is NP-, #P-, and VNP-hard. Expand
An Intelligent Failure Analysis System.
............................................................................................................................ xiii