Category:Computer science stubs

• Template:Comp-sci-stub

A

• Abstract entity
• Active form
• Acyclic
• Algorithm (C++)
• Algorithmic efficiency
• Algorithmics
• Alias
• Amdahl
• Angle bracket
• Anomaly detection
• Apparent motion
• Applied science
• Artificial neural network
• Aspect
• Automat
• Automata theory

B

• Base value
• BASIC
• Big o
• Binary search
• Biological computing
• Bisect
• Black box
• Boolean algebra
• Boolean function
• Boolean logic
• Boundary conditions
• BridgeOS
• Byte

C

• Category
• Catenate
• Checksum
• Classification scheme
• Clustered file system
• Coder
• Coinduction
• Commons:Category:Computer science
• Computability theory
• Computational geometry
• Computational mathematics
• Computational social science
• Computer data storage
• Computer scientist
• Concurrency (computer science)
• Conversation theory
• CSV
• Cue

D

• Daniel Boone
• Data degradation
• Data storage
• Data structure alignment
• Data Visualization
• Database management
• Defragmentation
• Desktop virtualization
• Device-independent pixel
• Devrim Cenk Ulusoy
• Digital data
• Dudley R. Herschbach
• Dyadic
• Dynamic linker

E

• Ensemble learning
• Event-driven
• Evolutionary computation
• Exokernel
• Externals

F

• Federal Information Processing Standards
• Flat memory model
• Floating-point arithmetic
• Foreshadow
• Formal language
• Formal methods
• Functional programming

G

• Generality
• Global illumination
• Glossary of computer science
• Google Native Client
• Gregory D. Hager

H

• Hamburger button
• Hard disk drive
• Hash table
• Hashtable
• High-level programming language
• Human-computer interaction
• Hyper-converged infrastructure

I

• Ignore
• Index
• Initial
• Inline caching
• Inode
• Instead
• Instruction cycle
• Integer overflow
• Inter-process communication
• IPadOS version history
• Irreducibility

L

• L4
• Lexicographic information cost
• Linear genetic programming
• Linearizability
• Listing
• Little-endian
• Locality-sensitive hashing
• Logic in computer science
• Logical consequence

M

• M-ALPHA
• MacBook Air
• Machine Learning
• MacOS Server
• Massively parallel
• Memoization
• Memory management
• Memory overcommitment
• Ml
• Model of computation
• Movable
• Multi-agent
• Multitasking

N

• Naive Bayes spam filtering
• Natural language processing
• Nearest neighbor search
• Necessity and sufficiency
• Networking hardware
• Neuromorphics
• Nibbles
• Number cruncher

O

• Object-oriented programming
• One to One
• Operator
• Oracle

P

• Packed
• Parsing
• Parts
• PASCAL
• Placement
• Possible
• Preload
• Program
• Programming language theory
• Programming languages
• Promise
• Properties

R

• Random
• Random number generation
• Rate limiting
• Reactive
• Read-only memory
• Recommender system
• Recover
• Recur
• Recursive ascent parser
• Reinforcement learning
• Relations
• Representational state transfer
• Restrict

S

• Sample
• Segment
• Semiconductor memory
• Sequentially
• Shared-nothing architecture
• Shortest job next
• Similarity
• Similarity measure
• Spell checker
• Static random-access memory
• Stored-program computer
• Survivability
• Syntax error

T

• Tahoe
• Temporary
• Theory of computation
• Top, bottom, switch
• Transient state
• Trimmed
• Tunneling

U

• Ubiquitous computing
• Unattached
• Unique
• Unresolved
• USB flash drive

V

• Vector graphics
• Vertex

X

• Xcode

Z

• Zone bit recording