ProfHewitt

7 ms·

1.
by ProfHewitt 5y ago
ActorsTheory serves as the rigorous mathematical foundations of capability systems.
2.
by ProfHewitt 5y ago
Foundation is about rigorously specifying the general Laws of Locality for Actor systems that CHERI implements.
3.
by ProfHewitt 5y ago
Great to see further progress on CHERI! See the following for theoretical foundations for the work: Linux 60th Anniversary Keynote https://t.co/IRe3vpMlWn
4.
by ProfHewitt 5y ago
Interesting article. Mathematical foundations are needed that are much more suitable to modern Computer Science than using "universes". For an example see the following article: https://papers.ssrn.com/abstract=360
5.
by ProfHewitt 5y ago
Computer science theory didn't get harder. Instead, education became weaker :-( See following link for foundations of computer Science: https://www.youtube.com/watch?v=AJP1VL7shiI
6.
by ProfHewitt 5y ago
The Actors Abstraction does not require specification of computer boundaries.
7.
by ProfHewitt 5y ago
The Actors Abstraction is foundational for computer science analogous to the Natural Numbers in classical mathematics.
8.
by ProfHewitt 5y ago
Probably not a good idea to burden application programmers with having to annotate each message send with whether the receiver is on the current computer or another one in a Citadel. Since Actors can move between computers in a Citadel, suc
9.
by ProfHewitt 5y ago
See the following for a rigorous definition of the Actors Abstraction: https://papers.ssrn.com/abstract=3418003
10.
by ProfHewitt 5y ago
Probably can't make much progress without a scientific foundation including the Actors Abstraction.
11.
by ProfHewitt 5y ago
The Actor Paradigm is much more widespread with offerings from Microsoft, Lightbend, etc.
12.
by ProfHewitt 5y ago
I fondly remember Joe Armstrong, who was a good friend. However, not having a mathematical foundation has been a severe limitation for Erlang. The Erlang community is trying to dig its way out with modifications and extensions. Still have
13.
by ProfHewitt 5y ago
Erlang has absolutely no security :-(
14.
by ProfHewitt 5y ago
In a Citadel, distributed Actors are going to be necessary. See the following: Citadels: faster response time and better information integration than remote datacenters https://papers.ssrn.com/abstract=2836282
15.
by ProfHewitt 5y ago
Also see offerings from Lightbend and Microsoft.
16.
by ProfHewitt 5y ago
Erlang incorporated some of the ideas of the Actor Abstraction but missed a few things. See See article and video here: https://papers.ssrn.com/abstract=3603021 https://www.youtube.com/watch?v=AJP1VL7shiI
17.
by ProfHewitt 5y ago
Swift Actors are an important contribution to the Actor Paradigm. There is is an upcoming keynote address on the Actor Paradigm at the Linux 30th Anniversary Conference. See https://reactivesummit2021.sched.com
18.
by ProfHewitt 5y ago
Both ASIO and Sender/Receiver are not a suitable foundation for concurrency in C++ .
19.
by ProfHewitt 5y ago
As dueling co-routine proposals neither ASIO nor Sender/Receiver are a suitable foundation for C++ semantics.
20.
by ProfHewitt 5y ago
Async co-routines are not a suitable foundation for C++ semantics.
21.
by ProfHewitt 5y ago
The Actors Abstraction is a much simpler and more powerful for formalizing the semantics of C++. See the following: https://papers.ssrn.com/abstract=3603021 https://www.youtube.com/watch?v=AJP1VL7shiI
22.
by ProfHewitt 5y ago
Slowing of progress in Science and Technology results from 1. Slowing of scientific processes Article is correct that high-quality science is still being performed. Because of increasing noise caused by enormous size,
23.
by ProfHewitt 5y ago
Contrary to the article discussed in these postings, having true but unprovable propositions in foundational theories of mathematics does not place any practical limitations on scientific knowledge.
24.
by ProfHewitt 5y ago
The Continuum Hypothesis is still an open question in foundational mathematical theories that are more powerful than 1st-order ZFC such as the theory Ordinals . See the following: https://papers.ssrn.com/abstract=3457802 S
25.
by ProfHewitt 5y ago
In foundational theories of mathematics, the following kind of proposition is true but unprovable: Theorems are enumerable by an algorithm. See the following article and associated video: https://papers.ssrn.com/ab
26.
by ProfHewitt 5y ago
The halting problem provides examples of true but unprovable propositions because there are some expressions that do not halt but it is unprovable that they do not halt.
27.
by ProfHewitt 5y ago
Theorems of a foundational system are not computationally enumerable (in fact they are not even countable). See the following article: https://papers.ssrn.com/abstract=3603021 In a foundational system, there are true prop
28.
by ProfHewitt 5y ago
It turns out that foundational mathematical systems can prove their own consistency. See the following: https://papers.ssrn.com/abstract=3603021 However, the proof is not convincing because the proof is valid even if the
29.
by ProfHewitt 5y ago
[Gödel 1931] proposed the proposition I’mUnprovable (such that I’mUnprovable ⇔⊬I’mUnprovable) for proving inferential undecidability of Russel’s foundational theory, which had the type-restriction on orders of propositions to prevent incon
30.
by ProfHewitt 5y ago
Bertrand Russell introduced orders on propositions to block construction of paradoxes such as “The Liar” [Russell 1908]. Without orders on propositions, the “self-referential” proposition I’mFalse (such that I’mFalse⇔¬I’mFalse) could be con

More ›