ASKiIMAN™ REALM 03 / COMPUTING
--:-- · -- --- ----
01001011 11010001
10110010 00101110
0
1
1
0
1
0

The Binary Universe

Representation of Numbers, Text, Images & Information

Central Doctrine

A computer ultimately works with physical states, but information must be represented in a form the machine can store, process, and transmit. This realm strips away the human interface to reveal how the entire digital world—numbers, text, colors, images, and sound—is mathematically encoded into absolute patterns of bits and bytes.

INFO → REPRESENTATION → ENCODING → BITS & BYTES → DATA → PROCESSING → DECODING

The Internal Chambers

Ontology of Digital Data

CHAMBER 01

Info as Representation

🌍
→
101010
  • Real-world info vs. Machine representation
  • Symbols, codes, and discrete data
  • Representing numbers, text, images & audio
CHAMBER 02

Bits

  • Binary digit: 0 and 1
  • Two-state logic (On/Off, True/False)
  • The basic unit of digital information
  • Physical meaning and combinations
CHAMBER 03

Byte & Data Units

  • Nibble (4 bits), Byte (8 bits), Word
  • Kilo, Mega, Giga, Tera, Peta, Exabyte
  • Data capacity and memory measurement
CHAMBER 04

Binary Number System

1286432168421
01010010
  • Base-2 positional notation
  • Powers of 2 and place values
  • Converting decimal to binary
CHAMBER 05

Octal Number System

0-7
  • Base-8 (Digits 0–7)
  • Relationship with 3-bit binary groups
  • Historical use and conversions
CHAMBER 06

Hexadecimal

  • Base-16 (Digits 0–9, A–F)
  • Memory addresses and machine representation
  • Color representation mapping (RGB)
CHAMBER 07

System Conversions

DEC↔BIN↔HEX
  • Decimal ↔ Binary ↔ Octal ↔ Hex
  • The mathematical mechanics of translation
CHAMBER 08

Binary Arithmetic

1
0101
+ 0111
1100
  • Addition, subtraction, multiplication, division
  • Carry, borrow, and overflow limits
  • How hardware circuits process logic
CHAMBER 09

Signed & Unsigned

1
0
1
  • Unsigned: Absolute magnitude
  • Signed: Allocating the Sign bit
  • Positive and negative ranges
CHAMBER 10

Two's Complement

0101 (5)
1010 (Inv)
1011 (-5)
  • Finding two's complement (Flip + 1)
  • Subtraction through addition
  • Zero representation and overflow detection
CHAMBER 11

Integer Representation

  • Fixed-width limits (8, 16, 32, 64-bit)
  • Range of representation
  • Overflow, underflow, and machine word size
CHAMBER 12

Fractional & Real

S
EXP
MANTISSA
  • Fixed-point vs. Floating-point
  • Sign, Exponent, Mantissa
  • Precision, rounding, and floating-point error
CHAMBER 13

Character Rep (ASCII)

'A'→65→01000001
  • Representing letters as binary numbers
  • 7-bit ASCII and extended characters
  • Control codes vs. printable characters
CHAMBER 14

Unicode

  • Universal text representation (Code points)
  • UTF-8, UTF-16, UTF-32 encodings
  • Multilingual text, symbols, and emoji
CHAMBER 15

Text as Data

01001000 01100101
01101100 01101100
01101111
  • Strings as sequences of encoded characters
  • Plain text, whitespace, and newlines
  • Encoding mismatches (Mojibake)
CHAMBER 16

Image Representation

  • Digital images, pixels, and raster grids
  • Resolution and image dimensions
  • Bit depth and color depth
CHAMBER 17

Color Representation

  • RGB additive color model
  • 8-bit, 24-bit, and 32-bit color channels
  • Hexadecimal colors and Alpha transparency
CHAMBER 18

Image Compression

→
  • Lossless vs. Lossy compression
  • Formats: PNG, JPEG, WebP
  • Redundancy, file size, and quality trade-offs
CHAMBER 19

Audio Representation

  • Analog sound vs. Digital sampling
  • Sampling rate, amplitude, and quantization
  • Bit depth and waveform representation
CHAMBER 20

Audio Compression

↓
  • Uncompressed (PCM, WAV) vs. Compressed
  • Lossless (FLAC) vs. Lossy (MP3, AAC)
  • Bitrate and compression ratios
CHAMBER 21

Video Representation

  • Frames, frame rate, and pixel resolution
  • Video compression and keyframes
  • Audio-video synchronization and streams
CHAMBER 22

Data Types

TXT
IMG
NUM
BOOL
  • Numbers, Strings, Booleans
  • Images, Audio, Video, Dates, Addresses
  • Structured vs. Unstructured data
CHAMBER 23

Boolean Values

1
0
  • True / False logic representation
  • Boolean data and variables
  • Direct link to hardware binary states
CHAMBER 24

Binary Encoding

A
01000001
  • Encoding vs. Decoding code tables
  • Fixed-length vs. Variable-length codes
  • Representation vs. Encryption/Compression
CHAMBER 25

Error & Integrity

10110100
  • Bit errors, noise, and corrupted data
  • Parity bits and Checksums
  • Error detection vs. Error correction
CHAMBER 26

Data Compression

→
  • Eliminating redundancy in data
  • Source size vs. Compressed size
  • Information loss and quality trade-offs
CHAMBER 27

Binary & Storage

  • Physical storage of bits (Magnetic/Flash)
  • Storage density and persistence
  • Files as physical collections of binary data
CHAMBER 28

Binary Transmission

  • Digital signals and bit streams
  • Serial vs. Parallel transmission
  • Data rate, bitrate, and bandwidth
CHAMBER 29

Files are Binary

010
110
001
101
  • Binary vs. Text files
  • File headers, metadata, and byte sequences
  • Structured formats and executables
CHAMBER 30

File Formats

PDF
PNG
MP3
JSON
  • Common encodings (TXT, CSV, JPEG, MP4)
  • File signatures / Magic numbers
  • Why extensions alone do not define content
CHAMBER 31

Representation Pipeline

  • Real World → Signal → Encoding → Bits
  • Storage/Processing → Decoding → Info
CHAMBER 32

One Idea, Many Reps

THE NUMBER 65↓
  • Number → Dec/Bin/Hex/Bits
  • Letter → Char/Unicode/UTF-8/Bits
  • Image → Pixels/RGB/File/Bits
CHAMBER 33

Key Comparisons

ASCII vs UNICODE
  • Bit vs Byte | Binary vs Decimal/Hex
  • Signed vs Unsigned | Integer vs Float
  • Lossless vs Lossy | Encoding vs Compression
CHAMBER 34

Problem Skills

A+
  • Base conversions and binary arithmetic
  • Two's complement problem solving
  • Data storage and media size calculations
CHAMBER 35

Foundational Formulas

2ⁿ
  • States with n bits: 2ⁿ
  • Unsigned range: 0 to 2ⁿ - 1
  • Signed range: -2ⁿ⁻¹ to 2ⁿ⁻¹ - 1
  • Image Size = W × H × Depth
CHAMBER 36

Key Vocabulary

UnicodeBitrateQuantization
  • Encoding, Decoding, Positional Notation
  • Pixel, Resolution, Sampling, Lossy
  • Parity, Checksum, Floating Point
FINAL CHAMBER

The Bridge to Logic

REALM 03 taught: INFO → BINARY → ENCODING
↓
REALM 04 asks: How do bits become logic?
0 + 1 → LOGIC GATES → COMPUTATION
  • The computer does not "see" a letter, image, or song.
  • IT SEES PATTERNS OF BITS.
  • Next, we build the physical logic gates that process them.