8 found
Order:
Disambiguations
Samuel Allen Alexander [7]Samuel A. Alexander [5]
See also
Samuel Allen Alexander
Ohio State University (PhD)
  1.  54
    Pseudo-Visibility: A Game Mechanic Involving Willful Ignorance.Samuel Allen Alexander & Arthur Paul Pedersen - 2022 - FLAIRS-35.
    We present a game mechanic called pseudo-visibility for games inhabited by non-player characters (NPCs) driven by reinforcement learning (RL). NPCs are incentivized to pretend they cannot see pseudo-visible players: the training environment simulates an NPC to determine how the NPC would act if the pseudo-visible player were invisible, and penalizes the NPC for acting differently. NPCs are thereby trained to selectively ignore pseudo-visible players, except when they judge that the reaction penalty is an acceptable tradeoff (e.g., a guard might accept (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. The Archimedean Trap: Why Traditional Reinforcement Learning Will Probably Not Yield AGI.Samuel Allen Alexander - 2020 - Journal of Artificial General Intelligence 11 (1):70-85.
    After generalizing the Archimedean property of real numbers in such a way as to make it adaptable to non-numeric structures, we demonstrate that the real numbers cannot be used to accurately measure non-Archimedean structures. We argue that, since an agent with Artificial General Intelligence (AGI) should have no problem engaging in tasks that inherently involve non-Archimedean rewards, and since traditional reinforcement learning rewards are real numbers, therefore traditional reinforcement learning probably will not lead to AGI. We indicate two possible ways (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. A Machine That Knows Its Own Code.Samuel A. Alexander - 2014 - Studia Logica 102 (3):567-576.
  4.  96
    Reward-Punishment Symmetric Universal Intelligence.Samuel Allen Alexander & Marcus Hutter - forthcoming - In AGI-21.
    Can an agent's intelligence level be negative? We extend the Legg-Hutter agent-environment framework to include punishments and argue for an affirmative answer to that question. We show that if the background encodings and Universal Turing Machine (UTM) admit certain Kolmogorov complexity symmetries, then the resulting Legg-Hutter intelligence measure is symmetric about the origin. In particular, this implies reward-ignoring agents have Legg-Hutter intelligence 0 according to such UTMs.
    Direct download  
     
    Export citation  
     
    Bookmark  
  5. Infinite Graphs in Systematic Biology, with an Application to the Species Problem.Samuel A. Alexander - 2013 - Acta Biotheoretica 61 (2):181--201.
    We argue that C. Darwin and more recently W. Hennig worked at times under the simplifying assumption of an eternal biosphere. So motivated, we explicitly consider the consequences which follow mathematically from this assumption, and the infinite graphs it leads to. This assumption admits certain clusters of organisms which have some ideal theoretical properties of species, shining some light onto the species problem. We prove a dualization of a law of T.A. Knight and C. Darwin, and sketch a decomposition result (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6. Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.
    Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  63
    Arithmetical Algorithms for Elementary Patterns.Samuel A. Alexander - 2015 - Archive for Mathematical Logic 54 (1-2):113-132.
    Elementary patterns of resemblance notate ordinals up to the ordinal of Pi^1_1-CA_0. We provide ordinal multiplication and exponentiation algorithms using these notations.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Self-Referential Theories.Samuel A. Alexander - 2020 - Journal of Symbolic Logic 85 (4):1687-1716.
    We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark