ProfHewitt

41 ms·

391.
by ProfHewitt 7y ago
Does anyone happen to know where is there an article on the (non)existence of the Y combinator typed using recursive parameterized types?
392.
by ProfHewitt 7y ago
Personal attacks have no place on Hacker News! Please confine your remarks to substantive issues. Hacker News is not a popularity contest. BTW. Wikipedia suffers many of the same bugs as other Internet Social Media. I started the Wikip
393.
by ProfHewitt 7y ago
Competent programmers compensate as best they can when using weaker tool chains, such as those lacking strong types.
394.
by ProfHewitt 7y ago
Unfortunately, the article leaves out types, which are an even more important topic for a "literate" programmer. The recursive definition of Y can easily be adapted to be strongly typed. However, there is no strongly typed Y co
395.
by ProfHewitt 7y ago
Unfortunately, the Y Combinator does not work for Actor programs, which can implement non-deterministic procedures that cannot be implemented in the non-deterministic lambda calculus. For further information, see the following: https:
396.
by ProfHewitt 7y ago
Some enterprising hacker should research who should be credited for the strongly-typed recursive def of Y.
397.
by ProfHewitt 7y ago
Sorry for the typo, HN on Android didn't enable me to fix it :-(
398.
by ProfHewitt 7y ago
Digital arbiters can theoretically take an arbitrary amount of time to settle although statistically they tend to settle soon rather than later. Also, if an Actor sends itself a 'stop' message over the Internet via Timbuktu, it c
399.
by ProfHewitt 7y ago
The Actor (which cannot be implemented by a nondeterministic TM) sends the 'stop' message to itself. However, just as there can be an arbitrarily long amount of time between two steps of a computation, there can be a arbitrarily
400.
by ProfHewitt 7y ago
Actors were influenced more by Simula-67 than by SmallTalk'72, which was a byte-stream language. However, neither language had adequate constructs for concurrency.
401.
by ProfHewitt 7y ago
The following article has a critique of Erlang as an Actor language: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3418003
402.
by ProfHewitt 7y ago
A thesis in the referenced article is that the Actor model formalizes digital computation.
403.
by ProfHewitt 7y ago
There is no "collaborator" in the Actor computation that Plotkin:s proof shows cannot be preformed by a nondeterministic Turing Machine.
404.
by ProfHewitt 7y ago
The article referenced presents a strongly-typed proof that the halting problem is compurationally undecidable. Nevertheless, Actors can perform computations impossible on a nondeterministic Turing Machine.
405.
by ProfHewitt 7y ago
There are simple nondetermintic procedures that can be implemented by digital circuits using arbiters that cannot be implemented by a nondeterminustic Turing Machine.
406.
by ProfHewitt 7y ago
The lambda calculus and Turing machines are both adequate for Church/Turing computability. However, neither are adequate for all digital computation.
407.
by ProfHewitt 7y ago
Object orientation derived from Simula-67 which was lexically scoped and preceded Sch3me by many years.