Results for 'UTME'

4 found
Order:
  1. Permutation of UTME multiple-choice test items on performance in use of English and mathematics among prospective higher education students.Bassey Asuquo Bassey, Isaac Ofem Ubi, German E. Anagbogu & Valentine Joseph Owan - 2020 - Journal of Social Sciences Research 6 (4):483-493.
    In an attempt to curtail examination malpractice, the Joint Admission and Matriculation Board (JAMB) has been generating different paper types with a different order of test items in the Unified Tertiary Matriculation Examination (UTME). However, the permutation of test items may compromise students’ performance unintentionally because constructive suggestions in theory and practice recommend that test items be sequenced in ascending order of difficulty. This study used data collected from a random sample of 1,226 SSIII students to ascertain whether the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Reward-Punishment Symmetric Universal Intelligence.Samuel Allen Alexander & Marcus Hutter - 2021 - In AGI.
    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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Turing Machines and Semantic Symbol Processing: Why Real Computers Don’t Mind Chinese Emperors.Richard Yee - 1993 - Lyceum 5 (1):37-59.
    Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, Searle's Chinese room (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Halting problem undecidability and infinitely nested simulation (V4).P. Olcott - manuscript
    A Simulating Halt Decider (SHD) computes the mapping from its input to its own accept or reject state based on whether or not the input simulated by a UTM would reach its final state in a finite number of simulated steps. -/- A halt decider (because it is a decider) must report on the behavior specified by its finite string input. This is its actual behavior when it is simulated by the UTM contained within its simulating halt decider while this (...)
    Download  
     
    Export citation  
     
    Bookmark