Search ETDs:
The Theory of Several Knowing Machines
Alexander, Samuel A.

2013, Doctor of Philosophy, Ohio State University, Mathematics.
We study the structure of interacting systems of truthful, mechanical knowing agents. This leads to three main consistency results. Suppose a system of knowing machines is arranged in a hierarchy, with some machines being subordinate to others. If this hierarchy is recursively enumerable and well founded, the following three situations are consistent. First, it is consistent that every machine knows the truthfulness of its subordinates and codes of every machine. Second, it is consistent that every machine knows the truthfulness of itself and its subordinates, codes of its subordinates, and the mechanicalness of every machine. Third, it is consistent that every machine knows the truthfulness of itself and its subordinates, the limited truthfulness of its superiors, codes of its subordinates, and the mechanicalness of itself and its subordinates. In addition we show that all the above situations are inconsistent if the hierarchy is ill founded and the agents are aware of rudimentary facts about the ordinal numbers.
Timothy Carlson, Dr. (Advisor)
Chris Miller, Dr. (Committee Member)
Stewart Shapiro, Dr. (Committee Member)
103 p.

Recommended Citations

Hide/Show APA Citation

Alexander, S. (2013). The Theory of Several Knowing Machines. (Electronic Thesis or Dissertation). Retrieved from https://etd.ohiolink.edu/

Hide/Show MLA Citation

Alexander, Samuel. "The Theory of Several Knowing Machines." Electronic Thesis or Dissertation. Ohio State University, 2013. OhioLINK Electronic Theses and Dissertations Center. 21 Nov 2017.

Hide/Show Chicago Citation

Alexander, Samuel "The Theory of Several Knowing Machines." Electronic Thesis or Dissertation. Ohio State University, 2013. https://etd.ohiolink.edu/

Files

dis4a.pdf (508.71 KB) View|Download