{menu}{mirror}

Scalable Permutations Preface:
"A Permutation of Agreeable Ideas"

Permutations are an axiom for all solvable problems that we face today and permutations are the only avenue for new discoveries. It is the seed of Artificial Intelligence to consider diverse possibilities and reserve to one with the least consequences. Without the intrinsic knowledge of a permutation, learning would not be possible. Millions of children around the world would endlessly force a square peg into a round hole not even realizing a better solution exists. To prove this fact, consider the following question presented below:
What's more important? "The permutation of agreeable ideas or the common synchronization response to a proven solution."
The statement presented above is a "Catch-22" scenario and cannot be divided. A permutation is the core of all educational processes, whereas often the beginning and ending routines surrounding a permutable core is a synchronization effect. Although synchronization is clearly not the focus of this book, it's important to mention at this juncture.

Synchronization by itself has a diverse meaning in the Computer Science field, but as presented above synchronization simply implies harmonic agreement of a presented solution or an understanding of one's environment at a given time. By definition two or more things are synchronized when they work in unison.

One case of an observable synchronization effect is when a teacher (or especially a music teacher) leads a group of students by repeated demonstrations and direct examples. At first students simply follow predictable and expected protocols, but after a short period of time (hopefully) the entire class is synchronized with the teacher. Often students will announce: "I get it now!" or "I understand what you are trying to do!" At certain level of confidence, a teacher can present a modified example or a new project for the students to solve.

Synchronization is the practice mimicking what is expected, which is very similar to playing the old game "Simon Says", until the student is comfortable incorporating optimal solutions using a permutation of agreeable ideas. At this point, the teacher and student are not synchronized. A synchronization effect returns only if the student can persuade the teacher that their newly discovered solution is infallible or the student agrees with the teacher's original solution.

Algorithms are not exempt from this important observation. Responsibility always falls upon the programmer's shoulders to challenge every known solution and ultimately offer a superior one. True programmers personally seek an absolutely optimized solution, which is the Holy Grail in the Computer Science field. For these presented reasons and many more, I wrote this book...

ENJOY Scalable Permutations {Work~In~Progress Preview}



[New Book: Scalable Permutations]

[QuickPerm] | [EXAMPLE 02] | [EXAMPLE 03] | [EXAMPLE 04] | [MetaPerm]
[Download the Five C++ Examples] | [Permutation Exercises]
[Contact the Author] | [Make a Donation] | [Links]
[HOME]

Help keep public education alive! We need your donations, click here to help now...

{top}

Copyright © 2019 by Phillip Paul Fuchs, all rights reserved. Valid XHTML 1.1 Strict Valid CSS!
Abstracting with credit is permitted...