ProfHewitt

9 ms·

91.
by ProfHewitt 5y ago
Because arbiters are used in communications among cores, a many-core computer has inherent indeterminacy.
92.
by ProfHewitt 5y ago
Thanks Marktangotango. Unfortunately, the above article is woefully incomplete and inaccurate because it is highly censored by Wikipedia. More comprehensive, up-to-date, and accurate information can be found here: * https://profe
93.
by ProfHewitt 5y ago
Tsimionescu: Thank you very much for finding these typos!!!! They should all now be fixed at SSRN :-) Can anyone find more typos or make other suggestions for improvement??? Thanks! Carl
94.
by ProfHewitt 5y ago
As said elsewhere in this posting: Nondeterministic Turing Machine has only bounded nondeterminism. That is, for a given input a Nondeterministic Turing Machine can only explore the number of alternatives bounded by its input. Actors do not
95.
by ProfHewitt 5y ago
A concession to the physical world?
96.
by ProfHewitt 5y ago
What exactly are the typos? Which paragraph is repeated?
97.
by ProfHewitt 5y ago
Scientific progress does occur! Recent advances are compatible with a long tradition with contributions by Euclid, Dedekind, Frege, Russell, Church, Turing, von Neumann, etc. The following article is in furtherance of the long tradition: h
98.
by ProfHewitt 5y ago
Proposition I'mUnprovable must not exist in foundational theories . A proof of inconsistency for a foundational theory that has I'mUnprovable appeared here: https://papers.ssrn.com/abstract=3603021
99.
by ProfHewitt 5y ago
An Actor cannot decide the halting problem for program expressions . See proof in the following: https://papers.ssrn.com/abstract=3603021
100.
by ProfHewitt 5y ago
If two propositions have the same characters, then they have the same Gödel numbers.
101.
by ProfHewitt 5y ago
Many-core computer systems and networked computer systems depend crucially on indeterminacy in order to gain performance. See the following https://papers.ssrn.com/abstract=3459566
102.
by ProfHewitt 5y ago
Nondeterministic Turing Machine has only bounded nondeterminism . That is, for a given input a Nondeterministic Turing Machine can only explore the number of alternatives bounded by its input. Actors do not have the limitation.
103.
by ProfHewitt 5y ago
Proofs forgot to include order of proposition in its Gödel number.
104.
by ProfHewitt 5y ago
Gödel proposition I'mUnprovable cannot be constructed in foundations because fixed-point construction violates orders on propositions. Existence of I'mUnprovable would render foundations inconsistent. See the following; https
105.
by ProfHewitt 5y ago
Turing machine can simulate multiple Turing Machines but cannot implement multiple Turing Machines communicating with each other because there is no means to communicate.
106.
by ProfHewitt 5y ago
Turing Machine can only do cooperative multiprogramming and cannot do time-interrupted scheduling.
107.
by ProfHewitt 5y ago
[Gödel 1931] encoded the characters of a proposition in its Gödel number but did not include the order of the proposition.
108.
by ProfHewitt 5y ago
Issue is that a Turing Machine cannot communicate with other Turing Machines in the middle of a computation.
109.
by ProfHewitt 5y ago
Veritasium, et. al. overlooked the crucial aspect that orders on propositions play in maintaining the consistency of foundations. Neglecting to include the order of a proposition in in its Gödel number makes it possible to mistakenly conclu
110.
by ProfHewitt 5y ago
Of course, Erlang can be accurately modeled using the theory of Actors. See discussion in Related Work section of the following article: https://papers.ssrn.com/abstract=3603021
111.
by ProfHewitt 5y ago
Do you have any reasoning to back up your belief?
112.
by ProfHewitt 5y ago
Twitter account is @ProfCarlHewitt and blog is https://professorhewitt.blogspot.com/ See following for a simple ActorScript program that cannot be implemented using a Nondeterministic Turing Machine: https://pape
113.
by ProfHewitt 5y ago
It is particularly ironic that Gödel deceived von Neumann about having already developed an important proof for [Gödel 1931]. The deception was discovered years after both had died. See [von Plato 2018]
114.
by ProfHewitt 5y ago
Good point, scotty79! In fact the [Gödel 1941] proposition I'mUnprovable does not exist in mathematical foundations.
115.
by ProfHewitt 5y ago
Development of Lambda Calculus [Church 1931] and Turing Machine [Turing 1936] were fundamental achievements. However, they are inadequate models of computation because there are digital computations they cannot implement. See the following
116.
by ProfHewitt 5y ago
Thanks jkhdigital! Of course, mathematical foundations must not be inconsistent . Homotopy type theory is an attempt address issues of equality in type theory.
117.
by ProfHewitt 5y ago
A fundamental problem with Wikipedia is that it doesn't have proper accountability for material that it publishes. Furthermore, Wikipedia is heavily censored by an anonymous group. See [von Plato 2018] on how Gödel deceived von Neumann
118.
by ProfHewitt 5y ago
There are very simple digital computations that cannot be performed by a Nondeterministic Turing Machine. See the following for an example: https://papers.ssrn.com/abstract=3603021
119.
by ProfHewitt 5y ago
myWindoonn: Do you have anything of actual substance to contribute to the the discussion?
120.
by ProfHewitt 5y ago
Mathematical foundations are indeed incomplete, that is, there are true propositions, which are unprovable. However, [Gödel 1931] failed to prove incompleteness of foundations using the nonexistent proposition I'mUnprovble . The [

More ›