Simple enough for every reader?
Re: Simple enough for every reader?
Re: Simple enough for every reader?
Re: Simple enough for every reader?
Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader? Re: Simple enough for every reader?
AI: Choose your favorite McDonald, Burger King, etc.. The story of Sam & Jony FYI, a snapshot of the open math copilot race How the requirements that Professor Sipser agreed to are exactly met Re: How the requirements that Professor Sipser agreed to are exactly met Re: How the requirements that Professor Sipser agreed to are exactly met Re: How the requirements that Professor Sipser agreed to are exactly met Re: How the requirements that Professor Sipser agreed to are exactly met --- Mike my best reviewer Logos 2000: rulial foundations Re: Logos 2000: rulial foundations Re: Logos 2000: rulial foundations Re: Logos 2000: rulial foundations Re: Michael Sipser of MIT validates the notion of a simulating halt decider Re: Michael Sipser of MIT validates the notion of a simulating halt decider Re: Michael Sipser of MIT validates the notion of a simulating halt decider Re: Michael Sipser of MIT validates the notion of a simulating halt decider Improved version: New proof of dark numbers by means of the thinned out harmonic series Improved version: New proof of dark numbers Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable ---ELABORATED Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable ---ELABORATED Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) USENET is the information panspermia (Was: Is Rossy Boy the new Archy Boy) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Is Rossy Boy the new Archy Boy (Was: Larger Collected Reasoning 2024) Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 Re: Larger Collected Reasoning 2024 All of computation and human reasoning can be encoded as finite string transformations All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All of computation and human reasoning can be encoded as finite string transformations --- Quine Re: All computation & human reasoning encoded as finite string transformations --- Quine Re: All computation & human reasoning encoded as finite string transformations --- Quine Re: All computation & human reasoning encoded as finite string transformations --- Quine Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error Turing Machine computable functions apply finite string transformations to inputs Re: Turing Machine computable functions apply finite string transformations to inputs Modularity is not compositionality Re: Modularity is not compositionality --- PLO DISCOVERY OF THE 1st SCIENTIFICALLY LOGICAL AFTERLIFE Re: Annotated Breakdown: "computing the mapping from an input" Re: Annotated Breakdown: "computing the mapping from an input" Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT Re: Cantor Diagonal Proof Re: Cantor Diagonal Proof Re: Dark numbers How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge ---WHY DO THIS? Re: How a True(X) predicate can be defined for the set of analytic knowledge ---WHY DO THIS? Re: How a True(X) predicate can be defined for the set of analytic knowledge ---WHY DO THIS? Re: How a True(X) predicate can be defined for the set of analytic knowledge ---WHY DO THIS? Re: How a True(X) predicate can be defined for the set of analytic knowledge ---WHY DO THIS? Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge ---ZFC Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge (GKEUL) Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge Re: How a True(X) predicate can be defined for the set of analytic knowledge (HoTT) Re: How a True(X) predicate can be defined for the set of analytic knowledge (HoTT) Re: How a True(X) predicate can be defined for the set of analytic knowledge (HoTT) Re: How a True(X) predicate can be defined for the set of analytic knowledge (HoTT)