Question: Do both LINK 480Z and CARDboard Illustrative Aid to Computation both involve computers?

Context paragraphs:
LINK 480Z: The LINK 480Z was an 8-bit microcomputer produced by Research Machines Limited in Oxford, England, during the early 1980s.

Dining cryptographers problem: In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function.  David Chaum first proposed this problem in the early 1980s and used it as an illustrative example to show that it was possible to send anonymous messages with unconditional sender and recipient untraceability.  Anonymous communication networks based on this problem are often referred to as DC-nets (where DC stands for "dining cryptographers").

Continuous-variable quantum information: Continuous-variable quantum information is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals.  One primary application is quantum computing.  In a sense, continuous-variable quantum computation is "analogue", while quantum computation using qubits is "digital."  In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional.  One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones.

Intelligent environment: Intelligent environments (IE) are spaces with embedded systems and information and communication technologies creating interactive spaces that bring computation into the physical world and enhance occupants experiences.  "Intelligent environments are spaces in which computation is seamlessly used to enhance ordinary activity.  One of the driving forces behind the emerging interest in highly interactive environments is to make computers not only genuine user-friendly but also essentially invisible to the user".

Quantum computing: Quantum computing studies computation systems (quantum computers) that make direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data.  Quantum computers are different from binary digital electronic computers based on transistors. Whereas common digital computing requires that the data be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits, which can be in superpositions of states.  A quantum Turing machine is a theoretical model of such a computer, and is also known as the universal quantum computer.  The field of quantum computing was initiated by the work of Paul Benioff and Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985.  A quantum computer with spins as quantum bits was also formulated for use as a quantum spacetime in 1968.

DiVincenzo's criteria: The DiVincenzo criteria are a list of conditions that are necessary for constructing a quantum computer proposed by the theoretical physicist David P. DiVincenzo in his 2000 paper "The Physical Implementation of Quantum Computation".  Quantum computation was first proposed by Richard Feynman (1982) as a means to efficiently simulate quantum systems.  There have been many proposals of how to construct a quantum computer, all of which have varying degrees of success against the different challenges of constructing quantum devices.  Some of these proposals involve using superconducting qubits, trapped ions, liquid and solid state nuclear magnetic resonance or optical cluster states all of which have remarkable prospects, however, they all have issues that prevent practical implementation.  The DiVincenzo criteria are a list of conditions that are necessary for constructing the quantum computer as proposed by Feynman.

CARDboard Illustrative Aid to Computation: CARDIAC (CARDboard Illustrative Aid to Computation) is a learning aid developed by David Hagelbarger and Saul Fingerman for Bell Telephone Laboratories in 1968 to teach high school students how computers work.  The kit consists of an instruction manual and a die-cut cardboard "computer".

Theory of computation: In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm.  The field is divided into three major branches: automata theory and language, computability theory, and computational complexity theory, which are linked by the question: ""What are the fundamental capabilities and limitations of computers?" ."

Model of computation: In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in computation and their respective costs.  It is used for measuring the complexity of an algorithm in execution time and or memory space: by assuming a certain model of computation, it is possible to analyze the computational resources required or to discuss the limitations of algorithms or computers.

Digital electronic computer: In computer science, a digital electronic computer is a computer machine which is both an electronic computer and a digital computer.  Examples of a digital electronic computers include the IBM PC, the Apple Macintosh as well as modern smartphones.  When computers that were both digital and electronic appeared, they displaced almost all other kinds of computers, but computation has historically been performed in various non-digital and non-electronic ways: the Lehmer sieve is an example of a digital non-electronic computer, while analog computers are examples of non-digital computers which can be electronic (with analog electronics), and mechanical computers are examples of non-electronic computers (which may be digital or not).  An example of a computer which is both non-digital and non-electronic is the ancient Antikythera mechanism found in Greece.  All kinds of computers, whether they are digital or analog, and electronic or non-electronic, can be Turing complete if they have sufficient memory.  A digital electronic computer is not necessarily a programmable computer, a stored program computer, or a general purpose computer, since in essence a digital electronic computer can be built for one specific application and be non-reprogrammable.  As of 2014, most personal computers and smartphones in people's homes that use multicore central processing units (such as AMD FX, Intel Core i7, or the multicore varieties of ARM-based chips) are also parallel computers using the MIMD (multiple instructions - multiple data) paradigm, a technology previously only used in digital electronic supercomputers.  As of 2014, most digital electronic supercomputers are also cluster computers, a technology that can be used at home in the form of small Beowulf clusters. Parallel computation is also possible with non-digital or non-electronic computers.  An example of a parallel computation system using the abacus would be a group of human computers using a number of abacus machines for computation and communicating using natural language.

Supporting paragraphs: LINK 480Z CARDboard Illustrative Aid to Computation
Answer: yes