Synergy

-------------------------------------------------
-------------------------------------------------

Devices

• Synergy Reactor XPS870 Adamant
• Synergy Reactor LTD375 Ethereal

-------------------------------------------------
-------------------------------------------------

Skyscraper

-------------------------------------------------
-------------------------------------------------

### Suite Layer

(Methodologies)

1) Power:
• Guru (Behavior Generator)
- Arcane (Guide)
• Flux (Vernacular Dialect)
- Shift (Modify)
• Tactic (Operative Planner)
- Operation (Scheme)
- Mission (Aim)
2) Boost:
• Immersion (Codex Decipher)
- Faculty (Educative), Facility (Cognitive), Factory, (Interactive), Foundry (Interpretive).
3) Source:
✓ Composed, CC1 (OPQ).
× Fixed, X86|ARM (ISA)
--------------------------------------------------

### Studio Layer

(Functionalities)

1) Languages
• Argot (Compilation)
• Slang (Interpretation)
• Lingo (Cannotation)
- Vibe (Synchronization)
2) Structures
• Wood( Logarithm)
• Leaf (Algorithm)
• Fruit (Fructrithm)
- Seed (Germirithm)
3) Intelligence
• Perceive (Fetch)
• Realize (Decode)
• Discern (Store)
- Express (Execute)
------------------------------------------------

### Study Layer

(Operabilities)

Computer Science

Computing:
• Time
• Analog|Digital=Evolving
• Math|Algebra|Calculus=Probability
• Engineering|Architecture=Infrastructure

*Security*
• Certainty (Compliance)
• Chance (Analysis)

*Coach*
• Bar (Repository)
• Maid (Surrogacy)

*Mark*
• Virtuoso: (Calculus)
• (Touch) (Continuous)
- Tapping (Restrict|Distinct)
- Swiping (Curve|Straight)
- Pinching (Combine|Separate)

• Maestro: (Algebra)
• (Graphic) (Linear)
- Icons
- Buttons
- Menus

• Cameo: (Math)
• (Command) (Discrete)
- Terminal
- Console
- Panel

*Trace*
• Tweak: (Tensor)
• (Build) (3D)
- Compiler (Sets|Maps)
- Assembler (Queue|Deque)
- Linker (Traverser|Iterators)

• Warp: (Vector)
• (Configure) (2D)
- Lexer (Inheritance|Reference)
- Parser (Array|Stack)
- Loader (Class|Object)

• Mold: (Scalar)
• (Write) (1D)
- Instruction (Pointer|Specifier)
- Function (Operator|Enumerator)
- Expression (Number|Character)

*Print*
• Nucleus:
- Tethering
- Routering
- Ruputering

• Plexus:
- Integrate
- Automate
- Orchestrate

• Nexus:
- Connection
- Collection
- Correction

*Draft*
• EmuSys
- Full System Emulation
• SimuSys
- Full System Simulation
• ModuSys
- Full System Modulation

*Plan*
• Dev
- Prototyping: Fidelity
- Testing: Validate, Feedback
- Iterating: Income, Outcome
- Maintaining: Cause, Enable

*Sketch*
• SLDF
- Schematics: Boards
- Layouts: Components
- Diagrams: Layers
- Footprint: Wiring

• EDRB
- Editor: Writing, Highlighting, Formatting
- Debugger: Executing, Inspecting, Setting
- Runner:
- Builder: Automating, Linking, Packaging
--------------------------------------------------

### Study Layer

(Operabilities)

Business Administration

Commercing:
• Money
• Cash|Accrual=Evolving
• Cost|Value|Price=Profitability
• Management|Administration=Organization

*Security*
• Law (Compliance)
• Risk (Analysis)

*Coach*
• Cafe (Manufacturer)
• Butler (Distributor)

*Office*
• StationState: (Price)
• (Economics) (Together)
- Market Forces: (Supply|Demand)
- Lineal Curves: (Substitute|Compliment)
- Circular Flow: (Entering|Exiting)

• MarketPlace: (Value)
• (Finance) (Detached)
- Cycles (Bearish|Bullish)
- Bands (Resist|Support)
- Funds (Sell|Buy)

• DoubleEntry: (Cost)
• (Accounting} (Individual)
- Accounts (Debits|Credits)
- Books (Deficit|Surfeit)
- Units (Ratios|Rates)

*Field*
• PublicRelation: (Channel)
• (Marketing) (Outcome)
- Endorsement (Promoting|Advertising)
- Environment (Scanning|Auditing)
- Emplacement (Researching|Positioning)

• PurchaseOrder: (Materiel)
• (Supply Chain) (Merchandise)
- Procurement (Sourcing|Bearing)
- Attainment (Provisioning|Logisting)
- Consignment (Listing|Vending)

• TimeSheet: (Personnel)
• (Human Resources) (Employee)
- Enrollment (Recruiting|Onboarding)
- Endearment (Training|Educating)
- Engagement (Registering|Vacationing)

*Outfit*
• Goods:
- Manufacturing
- Producting
- Fabricating

• Hybrid:
- Trading
- Distributing
- Negotiating

• Services:
- Prospecting
- Consumpting
- Transacting

*Agenda*
• Date
- Calendar|Clock
• Work
- Projects|Tasks
• Talk
- Spaces|Rooms

*Score*
• Bank
- Appraisal: Estimate
- Billing: Invoice|Receipt
- Payment: Withdrawal|Deposit
- Loaning: Investing|Financing

*Mend*
• Sales
- Technical
- Product
• Support
- Conventional
- Customer
-------------------------------------------------

### Study Layer

(Operabilities)

Thought Leadership

Concepting:
• Truth
• Liable|Exempt=Evolving
• Hint|Clue|Note=Perfectability
• Conscientious|Responsible=Accountable

*Security*
• Edict (Compliance)
• Odd (Analysis)

*Coach*
• Court (Cognominal)
• Jury (Testimonial)

*Doctrine*
• GavelBang: (Ultimately)
• (Commend) (Book)
-
-
-

• RobeScarf: (Exclusively)
• (Amend) (Chapter)
-
-
-

• BenchPodium: (Absolutely)
• (Emend) (Verse)
-
-
-

*Creed*
• AtonableGesture (Persistent)
• (Edition) (Paragraph)
-
-
-

• ReliableFact (Consistent)
• (Elution) (Sentence)
-
-
-

• CredibleStory: (Insistent)
• (Elation) (Word)
-
-
-

*Belief*
• Litigate
-
-
-

• Mitigate
-
-
-

• Limitate
-
-
-

*Tenet*
• Recording
-

• Reporting
-

*Idea*
• Intent
-

• Indent
-

*Thought*
• Inquiry
-

• Enquiry
-
-------------------------------------------------
-------------------------------------------------

Residence

-------------------------------------------------
-------------------------------------------------

### House Layer

2) (Hard) [|]
•Engine|Structure
-Board|Chip
~Dial|Core
1) (Hard-Mid) {~}
3) (Mid) (-) •Heart|Brain-Ears|Eyes~Flesh|Bone
1) (Soft-Mid) :•:
~Console|Solace
-Harmony|Clarity
•Strength|Rigidity
2) (Soft) <=>
--------------------------------------------------

### Room Layer

2) (Hard) [|]
•MachineOuterFace
-AbleWare
~NotaScribe
1) (Hard-Mid) {~}
3) (Mid) (-) •UserCenterFace-ThresWare~CrossScribe
1) (Soft-Mid) :•:
~EpiScribe
-ProWare
•HumanInterFace
2) (Soft) <=>
--------------------------------------------------

### Garage Layer

2) (Hard) [|]
•Mathematics
-Decimal
~Calculate
1) (Hard-Mid) {~}
3) (Mid) (-) •AlphaNumerics-Ordinal~Fluate
1) (Soft-Mid) :•:
~Translate
-Cardinal
•Linguistics
2) (Soft) <=>
--------------------------------------------------

### Basement Layer

2) (Hard) [|]
36
26|10
26=10
1) (Hard-Mid) {~}
13|13=5|5
6|1|6+6|1|6=2|1|2+2|1|2
3|3+1+3|3=3|3+1+3|3=1|1+1+1|1=1|1+1+1|1
3) (Mid) (-)
3|3+A+3|3=3|3+A+3|3=1|1+A+1|1=1|1+A+1|1
3+3-A-3+3=3+3-A-3+3=1+1-A-1+1=1+1-A-1+1
A-C*A*C-A=A-C*A*C-A=Z-O*Z*O-Z=Z-O*Z*O-Z
A+F-7-H+M=N+S-15-U+Z=Z+O-2-T+F=F+S-7-E+N
A|F+7+H|M=N|S+15+U|Z=Z|O-2-T|F=F|S+7+E|N
3) (Mid) (-)
A|F+G+H|M=N|S+T+U|Z=Z|O+T+T|F=F|S+S+E|N
AF|G|HM+NS|T|UZ=ZO|T|TF+FS|S|EN
M|Z=F|N
1) (Soft-Mid) :•:
MZ=FN
MZ|FN
ZN
2) (Soft) <=>
--------------------------------------------------

### Attic Layer

2) (Hard) [|]
Time
Infrastructure
Engineering|Architecture
1) (Hard-Mid) {~}
Math|Algebra|Calculus
Probability
Analog|Digital
3) (Mid) (-)
Conscientious|Responsible=Accountable
Perfectability=Hint|Clue|Note
Truth=Liable|Exempt
Perfectability=Hint|Clue|Note
Conscientious|Responsible=Accountable
3) (Mid) (-)
Cash|Accrual
Profitability
Cost|Value|Price
1) (Soft-Mid) :•:
Management|Administration
Organization
Money
2) (Soft) <=>
-------------------------------------------------
-------------------------------------------------

Resort

-------------------------------------------------
-------------------------------------------------

### (Sub)Kit Layer

2) (Hard) [|]
• Boot (Bootloader, Bootstrapper)
• Driver (Input, Output)
• Circuit (Register, Matrix)
• Memory (Cache, Flash)
• Storage (Disk, Drive)
• Speed (Buffer, Latency)
1) (Hard-Mid) {~}
- Data (Reading, Writing)
- Meta (Content, Context)
- Type (Effects, Params, Sums)
- Token (Node, Edge)
- Tree (Ordered, Labeled)
- Syntax (Manifest)
3) (Mid) (-) • System (Settings, Configs, Utilities.)
- Account (Nickname, Password)
- Profile (Intro, Bio, Info)
- Contacts (Friend, Family)
- Chat (Call, Text)
- Forum (Questions, Answers)
- Community (News)
1) (Soft-Mid) :•:
• Desk (Video, Image, Audio)
• Office (Slide, Sheet, Script)
• Work (Edit, Omit)
• Store (Upload, Download)
• Web (Domain, Email, Site)
• Explorer (Filer, Browser)
2) (Soft) <=>
--------------------------------------------------

### (Sub)Tier Layer

2) (Hard) [|]
• Artifact (Relic)
• Module (Opus)
• Library (Archive)
• Package (Chronicle)
• Framework (Treasury)
1) (Hard-Mid) {~}
- Tool (Chains)
3) (Mid) (-) • Application (Requisitions)
- Stack (Bundles)
1) (Soft-Mid) :•:
• Cavity (Vial)
• Container (Vault)
• Platform (Podium)
• Ecosystem (Fringe)
• Environment (Abode)
2) (Soft) <=>
--------------------------------------------------

### (Sub)Locale Layer

2) (Hard) [|]
• Database (Units)
1) (Hard-Mid) {~}
- Warehouse (Clusters)
3) (Mid) (-) • Internet (Networks)
- Network (Clusters)
1) (Soft-Mid) :•:
• Server (Units)
2) (Soft) <=>
--------------------------------------------------

### (Sub)Index Layer

2) (Hard) [|]
IdentifyingPlanningSchedulingAssigningPerforming
1) (Hard-Mid) {~}
TaskStepPlotFormGoal
3) (Mid) (-) InitializeConfigureBuildInstallDeploy
LumpThreadProcessPipelineWorkflow
1) (Soft-Mid) :•:
FileFolderPortfolioDossierRegistry
3) (Soft) <=>
--------------------------------------------------
--------------------------------------------------

Park

--------------------------------------------------
--------------------------------------------------

### Connectivity Layer

2) Wireless:
• Broadband • Broadcast
1) Comms:
• Telepathy
----------------------------------------------------
----------------------------------------------------

----------------------------------------------------
xxxxxxxxxxxxxxxxxxxxxxxxxxxx
----------------------------------------------------

----------------------------------------------------
----------------------------------------------------

# Computer Science (Revised)

Computer Science

Layers of Abstraction

Number Systems

• Number Systems: Decimal = 0-9, Binary = 0, 1, Octal = 0-8, Hexidecimal = 1-9 and a-f.

• There are Conversions for each pair.

• Each Number System has a: Radix, Base, Weight.

• The Radix is the number of Decimals in each Position.

• The Base is the same as the Radix.

• The Weight is the Base and the Power Of.

• The Power of is the number of the Position.

• Integers to the left, Fractionals to the right.

• Decimal: Has no Value.

• Binary: [1 = (on, yes, true, high)], or, [0 = (off, no, false, low)]. = 1 bit.

• Nibble = 4 bits.

• Octal: 8 bits = 1 byte.

• 2 bytes (16 bits) = Word.

• Hexadecimal: Prefix = 0x, Suffix = h.

• Little Endian = Least significant byte first.

• Big Endian = Most significant byte first.

Dec.  Bin.  Hex.
0       0      0
1       1      1
2      10      2
3      11      3
4     100      4
5     101      5
6     110      6
7     111      7
8    1000      8
9    1001      9
10   1010      a
11   1011      b
12   1100      c
13   1101      d
14   1110      e
15   1111      f

16 bit (4 bytes):
Bin: 0100 0111 1110 1101
Hex: 47ed

Dec Weight: 10*
Bin Weight: 2*
Oct Weight: 8*
Hex Weight: 16*

Hex: 0x55aa, 55aah.

Little Endian: 0x55aa, 55aah.
Big Endian: 0xaa55, aa55h.

Quantum Computing

• Normal computers are Binary. 1, or, 0. A bit.

• Bit stands for Binary Digit.

• Quantum computers use Qubits, for Quantum Binary Digits.

• Qubits can be in Superposition, both 1, and 0, simultaneously.

• This is called Quantum Entanglement.

Electronics

• Basic Electronics has: Resistor, Capacitor, Inductor, Transformer, Diode, Transistor.

• The transistor, a silicon semiconductor, was invented in 1956.

• They won a Nobel Prize in Physics for it.

• We use the letters N, and P to describe a Transistor. NPN, PNP.

• A Transistor has an Emitter, Base, Collector.

• It is a Current Controlled Switch.

• The Electrons would typically flow from the Emitter (N), to the Base (P), to the Collector (N).

Analog Circuits

• An electric current is Analog and in Decimal.

• It's measured in Volts.

• Wires carry the Voltage.

• Three basic circuits are: Series, Parallel, Series/Parallel.

Digital Circuits

• (The Conversion, Analog to Digital, is through ElectroMechanics.)

• A Digital Circuit is Binary.

• It's measured in bits.

• A single wire can carry 1 bit.

• (1 bit is roughly around 0.6V) (off < 0.6V < on). (Current Control Switch)

• There are two types of Digital Circuits: Combinational, Sequential.

Adders

• A Half-Adder is a XOR and AND Gate.

• It has A, B Inputs, and Sum and Carry Outputs.

• A Full Adder is two Half-Adders.

• It has A, B, C Inputs, and Sum, Carry Outputs.

• An 8 Bit Ripple Carry Adder, starts with a Half-Adder, and chains Full-Adders.

• Adding Full Adders to an 8 bit with 16 and 32 bit numbers prevents Overflow.

• There are circuits for Adding, Subtracting, Multiplying, and Division.

Digital Circuits wih Logic Gates

• They use Boolean Algebra and the Truth Table. (Mainly due to Logic.)

• They can have Input/Output.

• They can have Read/Write capabilities.

• 1 or more Digital Circuits can form a Latch.

• There are Gated Latches.

• A Latch can store 1 bit. Memory.

Memory

• Memory is Octal.

• A Group of Latches form a Register.

• A grid of Latches with MultiPlexors form a Matrix.

• An Address is the Intersection of a Matrix. Row and Column.

• An Address is Hexadecimal.

Registers

• 32 bit General Register example.

32 bit  8 bit  16 bit  8 bit,
EAX      AH      AX     AL,
EBX      BH      BX     BL,
ECX      CH      CX     CL,
EDX      DH      DX     DL,

A = Accumulator
B = Base
C = Counter
D = Data

H = High
L = Low

• 32 bit Index and Pointer Registers example.

32 bit  16 bit,
ESI     SI,
EDI     DI,
EBP     BP,
ESP     SP,

SI: Source Index.
DI: Destination Index.
BP: Base Pointer.
SP: Stack Pointer.

E: 32 bit.
R: 64 bit.

Buses

• There are Data, Address, and Control Buses.

• They are Job-Specific High-Speed Wires.

• They carry Data.

Ports

• Ports connect outside In/Out Devices.

Mainboard

• The Mainboards connects all components and a computer together.

Clock

• A Chip with a Crystal that Vibrates when Electricity is applied.

• It Oscillates, Physcics.

• And Generates Pulses.

• It is the smallest Frequency of a computer.

• It is measured in Hz.

• It Syncronizes all Components that require Time for their Operation.

• There are two types: Real-Time, Software Clocks.

CPU

• There are three main parts to the Central Processing Unit (CPU): The Control Unit (CU), the Arithmetic and Logic Unit (ALU), and the Memory Unit.

• It's four Main Functions: Input, Processing, Memory, Output.

CU

• The Control Unit manages computer ressources.

• It directs the flow of data between the CPU and other Devices.

• It will configure a CPU to manipulate the data correctly between instructions.

ALU

• Performs Mathematical Operations: Arithmitic and Logical Computation.

• Arithmitic handles all numerical operations. +, -, x, /.

• Logical handles all Logical Operations. AND, OR, NOT, XOR.

• It has two 8 bit Inputs. A 4 bit OpCode. An 8 bit Output. Overflow, Zero, Negative Flags.

Memory Unit

• The Memory Unit consists of Registers.

• There are 8 General Purpose Registers.

• The Accumultor, Base, Counter, Data Registers.

• The Base, Stack Pointer Registers.

• The Source, Destination Index Registers.

• It also has Flag Registers.

CPU Purpose

• The CPU's purpose is to execute Programs.

• Programs are made up of Instructions.

• The Instruction Cycle has four cycles: Fetch, Decode, Execute, Store.

• It takes a certain amount of Machine Cycles to execute an Instruction Cycle.

• Speed depends on the number of Clock Cycles needed to execute an Instruction.

• A Clock Cycle is the time taken between two Pulses of an Oscillator.

• A CPU performs a Clock Cycle, Machine Cycle, Instruction Cycle, respectively.

• Then the Instruction is executed.

Instruction Format

• 16 bit Instruction Format:

Prefix, OpCode, Mod-R/M, SIB, Disp, Imm.

  - Required:

Opcode, Disp, Imm.

Instruction Set

• A group of commands for a CPU in Machine Language.

• Can refer to all possible or subset instructions for a CPU.

Language Processing System

• Process: Pre-Processor, Compiler, Assembler, Linker, Loader, Memory.

• Pre-Processor: Produces Input for the Compiler.

• Compiler Phases: Lexical, Syntax, and Semantic Analyzer, Intermediate Code Generator, Machine independant Code Optimizer, Code Generator, Machine Dependant Code Optimizer.

• Assembler: Translates Assembly Language into Machine Code, and creates an Object file.

• Linker: Links and Merges various Object files to create an Executable.

• Loader/Memory: Loads Executable files into Memory and executes them.

Programming Languages

• There are Low Level and High Level Programming.

• They are used to make Intructions that make up Programs.

• They are written in Code.

• Each Programming Language's Intruction Code have their own Syntax.

• Incorrect Syntax will generate an Error.

• They guide the rules that guide the Logic of Hardware and Software Design.

Cyber Security

• Reverse-Engineered Debugging techniques.

• Ethical Hacking.

Data Structures and Algorithms

• Data Structures and Algorithms are an important part of Computer Science.

• Data Structures: Primitive, Non Primitive.

• Primitive: Numeric, Non Numeric.

• Non Primitive: Linear, Non Linear.

• Algorithms: Input, Output, Finiteness, Definiteness, Effectiveness.

• They help CPUs solve Problems.

Operating System

• An Operating System is an Interface between User Applications and Hardware.

• It helps manage the CPU's Input, Processing, Memory, Output.

• Four of it's Functions: Memory Management, Processor Management, Device Management, File Management.

• It has four Processes: Stack, Heap, Data, Text.

• It has Scheduling.

• It has Threads.

Cloud

• Cloud is a Network.

• It refers to manipulating, configurating, and accessing Applications online.

• It offers online data storage, infrastructure and application.

• Deployment Models: Public, Private, Hybrid, Community.

• Service Models: Infrastructure, Platform, Software, Identity, and Network as a Service.

Artificial Intelligence

• We are trying to get CPUs to think like Humans.

• Types of Intelligence: Linguistic, Musical, Logical, Mathematical, Spatial, Bodily-Kinesthetic, Intra-Personal, Interpersonal.

• It is composed of: Reasoning, Learning, Problem Solving, Perception, Linguistic.

• Task classification: Formal, Mundane, Expert.

• Machine Learning is a sub of Artificial Intelligence.

---

Math

• Theory, Analysis.

• Set, Field, Space, Structure, Object, Element, Function, Expression, Ring, Group, Symbol, Operation, Formula, Solution.

Algebra

• Elementary, Linear, Abstract, Universal.

Calculus

• Integral, Differentiation, Inverse.

• Convergence, Sequence, Series.

• Normal, Reverse.

• Limit.

Probability

• Theoretical, Experimental, Axiomatic.

• Description, Event, Occurrence.

• Mean, Deviation, Distribution.

• 0-1.

---

Discrete Math

• Sets, Combinatorics, Relations.

Linear Algebra

• Map, Matrix, Tensors, Vectors, Scalars.

Limit Calculus

• Continuity, Derivatives, Integrals, Function, Argument, Value.

Axiomatic Probability

• First, Second, Third.

---

Example with Layers of Abstraction

• Pseudocode Sorting and Classification Programs from Data Structures and Algorithms for Deep Learning of Neural Networks of Artificial Intelligence.

---

Hope you enjoyed!

Thanks!

Jesse Comeau
Owner/Founder
One.1