Difference between revisions of "Algebra of Systems"
| Line 32: | Line 32: | ||
==Closed elements in the closed ... forms an algebra== | ==Closed elements in the closed ... forms an algebra== | ||
[https://youtu.be/8zk0yS8Jp5w?t=3310 Closed elements forms ...] | [https://youtu.be/8zk0yS8Jp5w?t=3310 Closed elements forms ...] | ||
The last few minutes of lecture 3, Scott showed that there is a strong connection between algebra, complete [[lattice]], upper/lower bounds as [[closure]], and finally, [[fixed point]]. | |||
=References= | =References= | ||
Revision as of 06:14, 20 January 2022
Algebra of Systems[1] is a paper based on Koo's thesis[2].
A Concise Algebra for automating engineering tasks
This year 2009 paper summarized the following statement in the conclusion:
In Laws of programming[3], Hoare et al. questioned whether a small set of algebraic laws can be directly useful in a practical engineering design problem. The absence of a tool that can bridge the cognitive gap between mathematical abstractions and engineering problems may have been the main reason for their conservative attitude.
The above statement echos who Dana Scott[4] was saying in the 2018 Lambda Conference.
A lookup table as a enumerable function
He said in this lecture[5]:
If that lookup table is enumerable, that is a good definition of say that the enumeration operation is computable. ... So that computability here is on the same plane with enumerability.
Always think positively
He said the following[6]:
Don't think of divergence and all of that. ... You can only achieve what can possibly achieve. Don't think of things that cannot be done. This is the way how enumeration works. Working with the positives. Of course, you can think of complementary sets.
This is also where one can starting relating to the laws of composition.
Lambda Calculus allows you to notate Least Fixed Points
There is a well-foundedness as he mentioned at about 39 minutes into this video. He started talking about [7]. There is a connection between or Least Fixed Point of , and lambda calculus.
All Computable/Continuous Functions can be composed using Lambda Calculus
This where things get related to composition[8].
All Computable/Continuous Functions can be composed using Lambda Calculus and arithmetics. Arithmetics gives you the power of analyzing Gödel numbers and other kinds of structures.
The arithmetic mechanism can be represented using SK Combinators, therefore, each can be related to a specific kind of number[9]. The smaller numbers2, 3, 4 are assigned to do arithmetics.
Sub models with Closure Conditions within Computable Recursive Operators
There are ways to take closures in sub Lambad Calculus and iteration gives you recursive theory. It also allows one to filter out certain elements.
Closure is something can be expressed in Lambda Calculus[10].
Closed elements in the closed ... forms an algebra
Closed elements forms ... The last few minutes of lecture 3, Scott showed that there is a strong connection between algebra, complete lattice, upper/lower bounds as closure, and finally, fixed point.
References
- ↑ Koo, Hsueh-Yung Benjamin; Simmons, Willard; Crawley, Edward (Nov 16, 2021). "Algebra of Systems as a Meta Language for Model Synthesis and Analysis" (PDF). local page: IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS.
- ↑ Koo, Hsueh-Yung Benjamin (31 Jan 2005). A Meta-language for Systems Architecting (PDF) (Ph.D.). local page: MIT. Retrieved July 18, 2021.
- ↑ Hoare, C. A. R.; Hayes, I. J.; He, Jifeng; Morgan, C. C.; Roscoe, A. W.; Sanders, J. W.; Sorensen, I. H.; Spivey, J. M.; Sufrin, B. A. (Aug 1987). "Laws of Programming" (PDF). 30 (8). local page: ACM.
- ↑ Scott Commenting on a small algebra for combinators
- ↑ If the giant lookup table is enumerable ...
- ↑ Always think positively
- ↑ Least Fixed Point and Lambda Calculus
- ↑ All continuous functions can be composed of Lambda Calculus
- ↑ S and K as numbers 1 and 0 respectively
- ↑ Closure expressed in Lambda Calculus