Last Updated 07/17/2012

Posts By: Hewitt

Date | Post | Topic |

02/19/2012 | Inconsistency Robustness in Actor Systems | Long rant on Erlang-style Actors: Lost Dimension |

02/20/2012 | No rollback and retry mechanism built into Actor Model | Long rant on Erlang-style Actors: Lost Dimension |

02/23/2012 | Futures are simpler than promises | Long rant on Erlang-style Actors: Lost Dimension |

02/23/2012 | Futures are *very* simple | Long rant on Erlang-style Actors: Lost Dimension |

02/24/2012 | A future responds to a request with a retrun or throws | Long rant on Erlang-style Actors: Lost Dimension |

03/01/2012 | Deadlocking issues with Futures? | Long rant on Erlang-style Actors: Lost Dimension |

03/04/2012 | Actors are *very* abstract | Long rant on Erlang-style Actors: Lost Dimension |

03/05/2012 | Many-core computing is not for the faint of heart | Long rant on Erlang-style Actors: Lost Dimension |

03/05/2012 | No global states.in Actor Model | Long rant on Erlang-style Actors: Lost Dimension |

03/06/2012 | Indeterminacy and inconsistency are the norm | Long rant on Erlang-style Actors: Lost Dimension |

03/07/2012 | Futures are Actors | Long rant on Erlang-style Actors: Lost Dimension |

03/10/2012 | What is the definition of a promise? | Long rant on Erlang-style Actors: Lost Dimension |

03/15/2012 | Complexity of promises vs. simplicity of futures | Long rant on Erlang-style Actors: Lost Dimension |

03/17/2012 | Simplicity and conciseness of futures | Long rant on Erlang-style Actors: Lost Dimension |

03/19/2012 | Simplicity of futures | Long rant on Erlang-style Actors: Lost Dimension |

12/22/2011 | Actor Model is popular | Designing a languge — what theory is a must? |

12/22/2011 | Rigor should be a primary purpose | Designing a languge — what theory is a must? |

12/22/2011 | Garbage programming languages | Designing a languge — what theory is a must? |

12/22/2011 | The most widely used langauge started out as "garbage" | Designing a languge — what theory is a must? |

11/25/2011 | Actors all the way down | Actors all the way down |

11/25/2011 | "eval" should be a message instead of a procedure | Actors all the way down |

11/25/2011 | Extensitibility using "eval" messages | Actors all the way down |

11/26/2011 | Using "eval" messages for extensibility | Actors all the way down |

11/26/2011 | Actors as a foundation for funtional and imperative programming | Actors all the way down |

11/26/2011 | ActorScript implementation in progress | Actors all the way down |

09/11/2011 | Scalability require massive concurrency, not just parallelism | The Trouble with Erlang |

09/11/2011 | It is preferable to use futures instead of "yield" | Yield : Mainstream Delimited Continuations; "yield" from different languages compared and formalized |

06/26/2011 | Wittgenstein versus Turing on Inconsistency Robustness | Wittgenstein versus Turing on Inconsistency Robustness |

06/27/2011 | Wittgenstein advocated inconsistency-robust reasoning | Wittgenstein versus Turing on Inconsistency Robustness |

06/27/2011 | Liar's Paradox, Curry's Paradox, etc. have been tamed. | Wittgenstein versus Turing on Inconsistency Robustness |

06/27/2011 | Self-inferring Incompleteness while corralling the paradoxes | Wittgenstein versus Turing on Inconsistency Robustness |

06/29/2011 | Turing versus Wittgenstein | Wittgenstein versus Turing on Inconsistency Robustness |

06/30/2011 | Wittgenstein on Inconsistency Robustness | Wittgenstein versus Turing on Inconsistency Robustness |

06/28/2011 | Self-inferring incompleteness makes PM inconsistentent | Wittgenstein versus Turing on Inconsistency Robustness |

06/28/2011 | Principia Mathematica was Russell's baby | Wittgenstein versus Turing on Inconsistency Robustness |

06/27/2011 | Large software systems formally inconsistent with specifications | Wittgenstein versus Turing on Inconsistency Robustness |

06/28/2011 | People are highly inconsistency robust | Wittgenstein versus Turing on Inconsistency Robustness |

06/28/2011 | A standard inconsistency robust math for software engineering! | Wittgenstein versus Turing on Inconsistency Robustness |

06/28/2011 | Common sense for inconsistency-robust information integration | Wittgenstein versus Turing on Inconsistency Robustness |

03/05/2012 | Yes indeed!!! | Wittgenstein versus Turing on Inconsistency Robustness |

06/26/2011 | Inconsistency Robustness 2011 at Stanford | Inconsistency Robustness 2011 at Stanford |

06/27/2011 | Authors of accepted papers | Inconsistency Robustness 2011 at Stanford |

06/30/2011 | Dr. Hugo Mercier will be one of two invited keynote speakers | Inconsistency Robustness 2011 at Stanford |

07/14/2011 | Early registration cutoff is tomorrow | Inconsistency Robustness 2011 at Stanford |

08/21/2011 | Published refereed articles are available | Inconsistency Robustness 2011 at Stanford |

08/21/2011 | Symposium website is up | Inconsistency Robustness 2011 at Stanford |

08/24/2011 | A participant's "Report from Inconsistency Robustness 2011" | Inconsistency Robustness 2011 at Stanford |

09/03/2011 | Published refereed papers are up on the website. | Inconsistency Robustness 2011 at Stanford |

11/03/2011 | "Inconsistency Robustness: The State of the Art" on Nov. 7 | Inconsistency Robustness 2011 at Stanford |

11/24/2011 | International Society for Inconsistency Robustness(TM) | Inconsistency Robustness 2011 at Stanford |

06/27/2011 | "Strange Loop" should be credited to Doug Hofstadter | Strange Loop 2011 - Languages galore |

03/01/2011 | Middle History of Logic Programming | Middle History of Logic Programming |

03/02/2011 | Kowalski given IJCAI-11 Award for Research Excellence | Middle History of Logic Programming |

03/04/2011 | Logic Programming is a currently being neglected | Middle History of Logic Programming |

03/09/2011 | Many-core concurrency has supplanted backtracking | Middle History of Logic Programming |

03/09/2011 | A modern programming language ought to compile in linear time | Middle History of Logic Programming |

03/09/2011 | Type inference in linear time should be a requirement | Middle History of Logic Programming |

03/10/2011 | C++ header file slowness incented development of Google Go | Middle History of Logic Programming |

03/10/2011 | Compile time = wait time till programmer input is executable | Middle History of Logic Programming |

03/10/2011 | Compile time = wait time till program is executable | Middle History of Logic Programming |

06/28/2011 | Udated version | Middle History of Logic Programming |

02/27/2011 | Causal consistency is the answer to the memory model conundrum | Memory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010 |

02/27/2011 | Compare and Swap is not the answer | Memory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010 |

02/28/2011 | Transactional memory doesn't help the manycores | Memory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010 |

02/20/2011 | What is an Actor? | What is an Actor? |

02/20/2011 | Producedure calling is *not* faster than message passing | What is an Actor? |

02/21/2011 | ActorScript is a very simple programming language | What is an Actor? |

02/19/2011 | Turing versus Wittgenstein | Tractatus Digito-Philosophicus |

02/20/2011 | Language Games | Tractatus Digito-Philosophicus |

03/12/2011 | Gödel versus Wittgenstein | Tractatus Digito-Philosophicus |

02/20/2011 | Monads are unsuitable for concurrency | Monads vs. Actors |

02/20/2011 | In the age of many cores, concurrency is *always* relevant | Monads vs. Actors |

02/20/2011 | Initiating change is inherently about concurrency | Monads vs. Actors |

02/21/2011 | Monads in the lambda calculus can't change anything | Monads vs. Actors |

02/21/2011 | Even in a closed system, Actors can change | Monads vs. Actors |

02/21/2011 | Viewed from outside, the behavior of Actors can change | Monads vs. Actors |

02/21/2011 | Actors cannot be implemented in the lambda calculus | Monads vs. Actors |

02/22/2011 | Theorem of the Actor Model: Lambda calculus isn't universal | Monads vs. Actors |

02/22/2011 | A NDTM cannot implement unbounded nondeterminism | Monads vs. Actors |

02/23/2011 | Simple Actor system that computes an unbounded integer | Monads vs. Actors |

02/23/2011 | Computational Representation Theorem | Monads vs. Actors |

02/23/2011 | The big picture | Monads vs. Actors |

02/23/2011 | Arbiters are one possible source of unbounded nondeterminism | Monads vs. Actors |

02/24/2011 | Don't be discouraged | Monads vs. Actors |

02/24/2011 | The mail must go through! | Monads vs. Actors |

02/24/2011 | Interaction *creates* reality! | Monads vs. Actors |

02/22/2011 | Scientific Progress | Monads vs. Actors |

02/22/2011 | Not clear that Kuhn said something similar. | Monads vs. Actors |

02/22/2011 | Kuhn was great! | Monads vs. Actors |

02/23/2011 | Nice quote! | Monads vs. Actors |

01/14/2011 | How to Program the Many Cores for Inconsistency Robustness | How to Program the Many Cores for Inconsistency Robustness |

01/15/2011 | Excellent suggestion! | How to Program the Many Cores for Inconsistency Robustness |

01/15/2011 | Nondeterministic Turing Machine | How to Program the Many Cores for Inconsistency Robustness |

01/29/2011 | Slides are available for the video | How to Program the Many Cores for Inconsistency Robustness |

11/29/2010 | Preconditions can be timing dependent | Tolerant vs. Demanding Software |

11/29/2010 | Timing dependent preconditions are the norm | Tolerant vs. Demanding Software |

11/25/2010 | Inconsistency Robustness 2011 at Stanford | Inconsistency Robustness 2011 at Stanford |

11/26/2010 | Inconsistency Robustness is not limited to belief revision | Inconsistency Robustness 2011 at Stanford |

11/27/2010 | Perpetual, pervasive inconsistency | Inconsistency Robustness 2011 at Stanford |

11/23/2010 | What is computation? Concurrency versus Turing's Model | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Proving that a server provides service | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Real world many-core concurrent systems | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Actor model will get better. | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Croquet islands and E vats are awkward | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Assigning probabilities doesn't help | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Closed Actor system is not necessarily a NFA | What is computation? Concurrency versus Turing's Model |

11/24/2010 | NFA cannot implement closed Actor systems | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Nondeterministic Turing Machines cannot implement Actors | What is computation? Concurrency versus Turing's Model |

11/25/2010 | We want to prove that a server provides service to its clients | What is computation? Concurrency versus Turing's Model |

11/25/2010 | Concurrency versus nondeterministic choice | What is computation? Concurrency versus Turing's Model |

11/24/2010 | We are dealing with mathematical theorems. | What is computation? Concurrency versus Turing's Model |

11/24/2010 | Fixed broken link | What is computation? Concurrency versus Turing's Model |

11/25/2010 | No nondetermiistic choice in concurrency means so fairness issue | What is computation? Concurrency versus Turing's Model |

11/25/2010 | Simultaneity doesn't exist for events | What is computation? Concurrency versus Turing's Model |

11/26/2010 | Activities can overlap in time | What is computation? Concurrency versus Turing's Model |

11/25/2010 | An arbiter can be in no well-defined state arbitrarily long | What is computation? Concurrency versus Turing's Model |

11/26/2010 | Repeated nondeterministic choices versus eventual arrival | What is computation? Concurrency versus Turing's Model |

11/27/2010 | Actor Model Proof Theory | What is computation? Concurrency versus Turing's Model |

11/26/2010 | Finite traces have limitatins analogous to finite state machines | What is computation? Concurrency versus Turing's Model |

11/27/2010 | Dodging the fairness bullet | What is computation? Concurrency versus Turing's Model |

11/26/2010 | Only have to send one "stop" message. | What is computation? Concurrency versus Turing's Model |

11/26/2010 | Of course, you understand that your NDTM may not halt | What is computation? Concurrency versus Turing's Model |

11/27/2010 | The Actor system always halts but the NDTM doesn't | What is computation? Concurrency versus Turing's Model |

11/29/2010 | Infinite strings not needed; just infinite set of finite strings | What is computation? Concurrency versus Turing's Model |

02/22/2011 | A Nondeterministic Turing Machine has bounded nondetermiminism | What is computation? Concurrency versus Turing's Model |

11/29/2010 | Strictly speaking, Actor computations are partial orders | What is computation? Concurrency versus Turing's Model |

12/13/2010 | Computatonal Representation Theorem | What is computation? Concurrency versus Turing's Model |

02/22/2011 | Actors are computationally more powerful than NDTMs | What is computation? Concurrency versus Turing's Model |

12/02/2010 | ActorScript has types that are Actors | What is computation? Concurrency versus Turing's Model |

11/27/2010 | Recording history is not the same as operating in the present | Lambda the Ultimate seems an Overstatement (not) |

11/23/2010 | Monads don't work for concurrency | Lambda the Ultimate seems an Overstatement (not) |

11/24/2010 | Monads force sequencing | Lambda the Ultimate seems an Overstatement (not) |

11/24/2010 | Monads force sequencing because you have to get the state back | Lambda the Ultimate seems an Overstatement (not) |

11/29/2010 | Modularity and concurrency plus a lot more | Lambda the Ultimate seems an Overstatement (not) |

11/29/2010 | Independent shared resources cannot be implemented by monads | Lambda the Ultimate seems an Overstatement (not) |

11/29/2010 | Transactional memory doesn't scale and has lots of loose ends | Lambda the Ultimate seems an Overstatement (not) |

12/13/2010 | Computatonal Representation Theorem | Lambda the Ultimate seems an Overstatement (not) |

11/25/2010 | Users of a shared account not controlled by each other | Lambda the Ultimate seems an Overstatement (not) |

11/25/2010 | Sorry about that | Lambda the Ultimate seems an Overstatement (not) |

08/02/2010 | Incompleteness Theorems: The Logical Necessity of Inconsistency | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Video of Stanford Logic Colloquium on Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/02/2010 | A larger task | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Catch-22 in Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Inconsistency is Recursively Undecidable | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Recursive Undecidability follows from High Expressiveness | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Inconsistency Recursively Undecidable for *Classes* of theories | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Practical payoff is in larger systems | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | Validity of arguments is recursively decidable in Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/10/2010 | Validity of arguments is recursively decidable in Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

08/09/2010 | So far, only proof theory for Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

04/10/2010 | There is more to computation than (recursive) functions | splitting the program into formalizable vs. non-formalizable parts? |

04/01/2010 | Incompleteness Theorems: The Logical Necessity of Inconsistency | Incompleteness Theorems: The Logical Necessity of Inconsistency |

04/02/2010 | Relevance Logic versus Direct Logic | Incompleteness Theorems: The Logical Necessity of Inconsistency |

11/26/2011 | ActorScript tutorial | ActorScript(TM): Industrial strength integration of local and nonlocal concurrency for Client-cloud Computing |

03/05/2012 | Local time doesn't mean global states | Computing Needs Time |

LtU Topic Index Sorted by Date | LtU Topic Index Sorted by Topic | LtU Index of Post Authors | Zipped LtU Archive |