Viewing profile — ProfHewitt
ProfHewitt
HN member- Joined
- Thu, Aug 15, 2019, 12:21 AM UTC
- HN karma
- 250
- Public activity
- 419 items
- HN profile
- View on Hacker News ↗
About ProfHewitt
No profile information was provided.
Recent public activity
-
comment
Comment #30043641
ActorsTheory serves as the rigorous mathematical foundations of capability systems.
-
comment
Comment #30029331
Foundation is about rigorously specifying the general Laws of Locality for Actor systems that CHERI implements.
-
comment
Comment #30016807
Great to see further progress on CHERI! See the following for theoretical foundations for the work: Linux 60th Anniversary Keynote https://t.co/IRe3vpMlWn
-
comment
Comment #29827254
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: ht…
-
comment
Comment #29247585
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
-
comment
Comment #29040590
The Actors Abstraction does not require specification of computer boundaries.
-
comment
Comment #29040545
The Actors Abstraction is foundational for computer science analogous to the Natural Numbers in classical mathematics.
-
comment
Comment #29040420
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 Citade…
-
comment
Comment #29040366
See the following for a rigorous definition of the Actors Abstraction: https://papers.ssrn.com/abstract=3418003
-
comment
Comment #29040339
Probably can't make much progress without a scientific foundation including the Actors Abstraction.
-
comment
Comment #29040286
The Actor Paradigm is much more widespread with offerings from Microsoft, Lightbend, etc.
-
comment
Comment #29040179
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…
-
comment
Comment #29040060
Erlang has absolutely no security :-(
-
comment
Comment #29040050
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://pap…
-
comment
Comment #29039980
Also see offerings from Lightbend and Microsoft.
-
comment
Comment #29039957
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…
-
comment
Comment #29039629
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:…
-
comment
Comment #28920264
Both ASIO and Sender/Receiver are not a suitable foundation for concurrency in C++ .
-
comment
Comment #28920228
As dueling co-routine proposals neither ASIO nor Sender/Receiver are a suitable foundation for C++ semantics.
-
comment
Comment #28920193
Async co-routines are not a suitable foundation for C++ semantics.
-
comment
Comment #28915301
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…
-
comment
Comment #28844979
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 incr…
-
comment
Comment #28828155
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 sci…
-
comment
Comment #28828087
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: …
-
comment
Comment #28828026
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…