Lambda the Ultimate Weblog Topics
Last Updated 07/17/2012

Posts By: Hewitt

  Date    Post    Topic  
02/19/2012Inconsistency Robustness in Actor SystemsLong rant on Erlang-style Actors: Lost Dimension
02/20/2012No rollback and retry mechanism built into Actor ModelLong rant on Erlang-style Actors: Lost Dimension
02/23/2012Futures are simpler than promisesLong rant on Erlang-style Actors: Lost Dimension
02/23/2012Futures are *very* simpleLong rant on Erlang-style Actors: Lost Dimension
02/24/2012A future responds to a request with a retrun or throwsLong rant on Erlang-style Actors: Lost Dimension
03/01/2012Deadlocking issues with Futures?Long rant on Erlang-style Actors: Lost Dimension
03/04/2012Actors are *very* abstractLong rant on Erlang-style Actors: Lost Dimension
03/05/2012Many-core computing is not for the faint of heartLong rant on Erlang-style Actors: Lost Dimension
03/05/2012No global states.in Actor ModelLong rant on Erlang-style Actors: Lost Dimension
03/06/2012Indeterminacy and inconsistency are the normLong rant on Erlang-style Actors: Lost Dimension
03/07/2012Futures are ActorsLong rant on Erlang-style Actors: Lost Dimension
03/10/2012What is the definition of a promise?Long rant on Erlang-style Actors: Lost Dimension
03/15/2012Complexity of promises vs. simplicity of futuresLong rant on Erlang-style Actors: Lost Dimension
03/17/2012Simplicity and conciseness of futuresLong rant on Erlang-style Actors: Lost Dimension
03/19/2012Simplicity of futuresLong rant on Erlang-style Actors: Lost Dimension
12/22/2011Actor Model is popularDesigning a languge — what theory is a must?
12/22/2011Rigor should be a primary purposeDesigning a languge — what theory is a must?
12/22/2011Garbage programming languagesDesigning a languge — what theory is a must?
12/22/2011The most widely used langauge started out as "garbage"Designing a languge — what theory is a must?
11/25/2011Actors all the way downActors all the way down
11/25/2011"eval" should be a message instead of a procedureActors all the way down
11/25/2011Extensitibility using "eval" messagesActors all the way down
11/26/2011Using "eval" messages for extensibilityActors all the way down
11/26/2011Actors as a foundation for funtional and imperative programmingActors all the way down
11/26/2011ActorScript implementation in progressActors all the way down
09/11/2011Scalability require massive concurrency, not just parallelismThe Trouble with Erlang
09/11/2011It is preferable to use futures instead of "yield"Yield : Mainstream Delimited Continuations; "yield" from different languages compared and formalized
06/26/2011Wittgenstein versus Turing on Inconsistency RobustnessWittgenstein versus Turing on Inconsistency Robustness
06/27/2011Wittgenstein advocated inconsistency-robust reasoningWittgenstein versus Turing on Inconsistency Robustness
06/27/2011Liar's Paradox, Curry's Paradox, etc. have been tamed.Wittgenstein versus Turing on Inconsistency Robustness
06/27/2011Self-inferring Incompleteness while corralling the paradoxesWittgenstein versus Turing on Inconsistency Robustness
06/29/2011Turing versus WittgensteinWittgenstein versus Turing on Inconsistency Robustness
06/30/2011Wittgenstein on Inconsistency RobustnessWittgenstein versus Turing on Inconsistency Robustness
06/28/2011Self-inferring incompleteness makes PM inconsistententWittgenstein versus Turing on Inconsistency Robustness
06/28/2011Principia Mathematica was Russell's babyWittgenstein versus Turing on Inconsistency Robustness
06/27/2011Large software systems formally inconsistent with specificationsWittgenstein versus Turing on Inconsistency Robustness
06/28/2011People are highly inconsistency robustWittgenstein versus Turing on Inconsistency Robustness
06/28/2011A standard inconsistency robust math for software engineering!Wittgenstein versus Turing on Inconsistency Robustness
06/28/2011Common sense for inconsistency-robust information integrationWittgenstein versus Turing on Inconsistency Robustness
03/05/2012Yes indeed!!!Wittgenstein versus Turing on Inconsistency Robustness
06/26/2011Inconsistency Robustness 2011 at StanfordInconsistency Robustness 2011 at Stanford
06/27/2011Authors of accepted papersInconsistency Robustness 2011 at Stanford
06/30/2011Dr. Hugo Mercier will be one of two invited keynote speakersInconsistency Robustness 2011 at Stanford
07/14/2011Early registration cutoff is tomorrowInconsistency Robustness 2011 at Stanford
08/21/2011Published refereed articles are availableInconsistency Robustness 2011 at Stanford
08/21/2011Symposium website is upInconsistency Robustness 2011 at Stanford
08/24/2011A participant's "Report from Inconsistency Robustness 2011"Inconsistency Robustness 2011 at Stanford
09/03/2011Published refereed papers are up on the website.Inconsistency Robustness 2011 at Stanford
11/03/2011"Inconsistency Robustness: The State of the Art" on Nov. 7Inconsistency Robustness 2011 at Stanford
11/24/2011International Society for Inconsistency Robustness(TM)Inconsistency Robustness 2011 at Stanford
06/27/2011"Strange Loop" should be credited to Doug HofstadterStrange Loop 2011 - Languages galore
03/01/2011Middle History of Logic ProgrammingMiddle History of Logic Programming
03/02/2011Kowalski given IJCAI-11 Award for Research ExcellenceMiddle History of Logic Programming
03/04/2011Logic Programming is a currently being neglectedMiddle History of Logic Programming
03/09/2011Many-core concurrency has supplanted backtrackingMiddle History of Logic Programming
03/09/2011A modern programming language ought to compile in linear timeMiddle History of Logic Programming
03/09/2011Type inference in linear time should be a requirementMiddle History of Logic Programming
03/10/2011C++ header file slowness incented development of Google GoMiddle History of Logic Programming
03/10/2011Compile time = wait time till programmer input is executableMiddle History of Logic Programming
03/10/2011Compile time = wait time till program is executableMiddle History of Logic Programming
06/28/2011Udated versionMiddle History of Logic Programming
02/27/2011Causal consistency is the answer to the memory model conundrumMemory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010
02/27/2011Compare and Swap is not the answerMemory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010
02/28/2011Transactional memory doesn't help the manycoresMemory Models: A Case for Rethinking Parallel Languages and Hardware, CACM, August 2010
02/20/2011What is an Actor?What is an Actor?
02/20/2011Producedure calling is *not* faster than message passingWhat is an Actor?
02/21/2011ActorScript is a very simple programming languageWhat is an Actor?
02/19/2011Turing versus WittgensteinTractatus Digito-Philosophicus
02/20/2011Language GamesTractatus Digito-Philosophicus
03/12/2011Gödel versus WittgensteinTractatus Digito-Philosophicus
02/20/2011Monads are unsuitable for concurrencyMonads vs. Actors
02/20/2011In the age of many cores, concurrency is *always* relevantMonads vs. Actors
02/20/2011Initiating change is inherently about concurrencyMonads vs. Actors
02/21/2011Monads in the lambda calculus can't change anythingMonads vs. Actors
02/21/2011Even in a closed system, Actors can changeMonads vs. Actors
02/21/2011Viewed from outside, the behavior of Actors can changeMonads vs. Actors
02/21/2011Actors cannot be implemented in the lambda calculusMonads vs. Actors
02/22/2011Theorem of the Actor Model: Lambda calculus isn't universalMonads vs. Actors
02/22/2011A NDTM cannot implement unbounded nondeterminismMonads vs. Actors
02/23/2011Simple Actor system that computes an unbounded integerMonads vs. Actors
02/23/2011Computational Representation TheoremMonads vs. Actors
02/23/2011The big pictureMonads vs. Actors
02/23/2011Arbiters are one possible source of unbounded nondeterminismMonads vs. Actors
02/24/2011Don't be discouragedMonads vs. Actors
02/24/2011The mail must go through!Monads vs. Actors
02/24/2011Interaction *creates* reality!Monads vs. Actors
02/22/2011Scientific ProgressMonads vs. Actors
02/22/2011Not clear that Kuhn said something similar.Monads vs. Actors
02/22/2011Kuhn was great!Monads vs. Actors
02/23/2011Nice quote!Monads vs. Actors
01/14/2011How to Program the Many Cores for Inconsistency RobustnessHow to Program the Many Cores for Inconsistency Robustness
01/15/2011Excellent suggestion!How to Program the Many Cores for Inconsistency Robustness
01/15/2011Nondeterministic Turing MachineHow to Program the Many Cores for Inconsistency Robustness
01/29/2011Slides are available for the videoHow to Program the Many Cores for Inconsistency Robustness
11/29/2010Preconditions can be timing dependentTolerant vs. Demanding Software
11/29/2010Timing dependent preconditions are the normTolerant vs. Demanding Software
11/25/2010Inconsistency Robustness 2011 at StanfordInconsistency Robustness 2011 at Stanford
11/26/2010Inconsistency Robustness is not limited to belief revisionInconsistency Robustness 2011 at Stanford
11/27/2010Perpetual, pervasive inconsistencyInconsistency Robustness 2011 at Stanford
11/23/2010What is computation? Concurrency versus Turing's ModelWhat is computation? Concurrency versus Turing's Model
11/24/2010Proving that a server provides serviceWhat is computation? Concurrency versus Turing's Model
11/24/2010Real world many-core concurrent systemsWhat is computation? Concurrency versus Turing's Model
11/24/2010Actor model will get better.What is computation? Concurrency versus Turing's Model
11/24/2010Croquet islands and E vats are awkwardWhat is computation? Concurrency versus Turing's Model
11/24/2010Assigning probabilities doesn't helpWhat is computation? Concurrency versus Turing's Model
11/24/2010Closed Actor system is not necessarily a NFAWhat is computation? Concurrency versus Turing's Model
11/24/2010NFA cannot implement closed Actor systemsWhat is computation? Concurrency versus Turing's Model
11/24/2010Nondeterministic Turing Machines cannot implement ActorsWhat is computation? Concurrency versus Turing's Model
11/25/2010We want to prove that a server provides service to its clientsWhat is computation? Concurrency versus Turing's Model
11/25/2010Concurrency versus nondeterministic choiceWhat is computation? Concurrency versus Turing's Model
11/24/2010We are dealing with mathematical theorems.What is computation? Concurrency versus Turing's Model
11/24/2010Fixed broken linkWhat is computation? Concurrency versus Turing's Model
11/25/2010No nondetermiistic choice in concurrency means so fairness issueWhat is computation? Concurrency versus Turing's Model
11/25/2010Simultaneity doesn't exist for eventsWhat is computation? Concurrency versus Turing's Model
11/26/2010Activities can overlap in timeWhat is computation? Concurrency versus Turing's Model
11/25/2010An arbiter can be in no well-defined state arbitrarily longWhat is computation? Concurrency versus Turing's Model
11/26/2010Repeated nondeterministic choices versus eventual arrivalWhat is computation? Concurrency versus Turing's Model
11/27/2010Actor Model Proof TheoryWhat is computation? Concurrency versus Turing's Model
11/26/2010Finite traces have limitatins analogous to finite state machinesWhat is computation? Concurrency versus Turing's Model
11/27/2010Dodging the fairness bulletWhat is computation? Concurrency versus Turing's Model
11/26/2010Only have to send one "stop" message.What is computation? Concurrency versus Turing's Model
11/26/2010Of course, you understand that your NDTM may not haltWhat is computation? Concurrency versus Turing's Model
11/27/2010The Actor system always halts but the NDTM doesn'tWhat is computation? Concurrency versus Turing's Model
11/29/2010Infinite strings not needed; just infinite set of finite stringsWhat is computation? Concurrency versus Turing's Model
02/22/2011A Nondeterministic Turing Machine has bounded nondetermiminismWhat is computation? Concurrency versus Turing's Model
11/29/2010Strictly speaking, Actor computations are partial ordersWhat is computation? Concurrency versus Turing's Model
12/13/2010Computatonal Representation TheoremWhat is computation? Concurrency versus Turing's Model
02/22/2011Actors are computationally more powerful than NDTMsWhat is computation? Concurrency versus Turing's Model
12/02/2010ActorScript has types that are ActorsWhat is computation? Concurrency versus Turing's Model
11/27/2010Recording history is not the same as operating in the presentLambda the Ultimate seems an Overstatement (not)
11/23/2010Monads don't work for concurrencyLambda the Ultimate seems an Overstatement (not)
11/24/2010Monads force sequencingLambda the Ultimate seems an Overstatement (not)
11/24/2010Monads force sequencing because you have to get the state backLambda the Ultimate seems an Overstatement (not)
11/29/2010Modularity and concurrency plus a lot moreLambda the Ultimate seems an Overstatement (not)
11/29/2010Independent shared resources cannot be implemented by monadsLambda the Ultimate seems an Overstatement (not)
11/29/2010Transactional memory doesn't scale and has lots of loose endsLambda the Ultimate seems an Overstatement (not)
12/13/2010Computatonal Representation TheoremLambda the Ultimate seems an Overstatement (not)
11/25/2010Users of a shared account not controlled by each otherLambda the Ultimate seems an Overstatement (not)
11/25/2010Sorry about thatLambda the Ultimate seems an Overstatement (not)
08/02/2010Incompleteness Theorems: The Logical Necessity of InconsistencyIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Video of Stanford Logic Colloquium on Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
08/02/2010A larger taskIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Catch-22 in Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Inconsistency is Recursively UndecidableIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Recursive Undecidability follows from High ExpressivenessIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Inconsistency Recursively Undecidable for *Classes* of theoriesIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Practical payoff is in larger systemsIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010Validity of arguments is recursively decidable in Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
08/10/2010Validity of arguments is recursively decidable in Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
08/09/2010So far, only proof theory for Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
04/10/2010There is more to computation than (recursive) functionssplitting the program into formalizable vs. non-formalizable parts?
04/01/2010Incompleteness Theorems: The Logical Necessity of InconsistencyIncompleteness Theorems: The Logical Necessity of Inconsistency
04/02/2010Relevance Logic versus Direct LogicIncompleteness Theorems: The Logical Necessity of Inconsistency
11/26/2011ActorScript tutorialActorScript(TM): Industrial strength integration of local and nonlocal concurrency for Client-cloud Computing
03/05/2012Local time doesn't mean global statesComputing Needs Time

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

Chris Rathman/ Chris.Rathman@tx.rr.com