Results for 'Oracle construction'

970 found
Order:
  1.  40
    Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP.Gerhard Lischke - 1986 - Mathematical Logic Quarterly 32 (17-18):257-270.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  6
    Oracle Bone Inscriptions in Anyang City, China: Construction of Self-Identity and Utilizing Values Inherited from the Past.Jiao Pu, Supachai Singyabuth, Chen Lu, Li Ying & Li Haiyan4 - forthcoming - Evolutionary Studies in Imaginative Culture:624-636.
    This research, focusing on the 'Oracle Bone Script' of Anyang City, China, holds significant academic value. It delves into the discovery of oracle bones and their use for divination and sacrifice during the Shang Dynasty, shedding light on the social, political, economic, and cultural aspects of the time, as well as local wisdom. The study investigates the connection between oracle bones and the lives and society of the local people in Anyang, including the construction of identity (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. The oracle of selfie. Digital identity and the social construction of self esteem.Martin A. M. Gansinger - manuscript
  4.  36
    The Moral Oracle’s Test.Sven Ove Hansson - 2014 - Ethical Theory and Moral Practice 17 (4):643-651.
    When presented with a situation involving an agent’s choice between alternative actions, a moral oracle says what the agent is allowed to do. The oracle bases her advice on some moral theory, but the nature of that theory is not known by us. The moral oracle’s test consists in determining whether a series of questions to the oracle can be so constructed that her answers will reveal which of two given types of theories she adheres to. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  27
    Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
    We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, unresetting and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  36
    Non-bounding constructions.J. R. Shoenfield - 1990 - Annals of Pure and Applied Logic 50 (2):191-205.
    The object of this paper is to explain a certain type of construction which occurs in priority proofs and illustrate it with two examples due to Lachlan and Harrington. The proofs in the examples are essentially the original proofs; our main contribution is to isolate the common part of these proofs. The key ideas in this common part are due to Lachlan; we include several improvements due to Harrington, Soare, Slaman, and the author.Our notation is fairly standard. If X (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  7. Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
    In this article we find some sufficient and some necessary ${\Sigma^1_1}$ -conditions with oracles for a model to be resplendent or chronically resplendent. The main tool of our proofs is internal arguments, that is analogues of classical theorems and model-theoretic constructions conducted inside a model of first-order Peano Arithmetic: arithmetised back-and-forth constructions and versions of the arithmetised completeness theorem, namely constructions of recursively saturated and resplendent models from the point of view of a model of arithmetic. These internal arguments are (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  29
    From divine oracles to the higher criticism: Andrew D. white and the warfare of science with theology in christendom.James C. Ungureanu - 2021 - Zygon 56 (1):209-233.
    Historians of science and religion have given little attention to how historical‐critical scholarship influenced perceptions of the relationship between science and religion in the nineteenth century. However, the so‐called “cofounders” of the “conflict thesis,” the idea that science and religion are fundamentally and irrevocable at odds, were greatly affected by this literature. Indeed, in his two‐volume magnum opus, A History of the Warfare of Science with Theology in Christendom (1896), Andrew D. White, in his longest and final chapter of his (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  10
    Towards the Actual Relationship Between NP and Exponential Time.Gerhard Lischke - 1999 - Mathematical Logic Quarterly 45 (1):31-49.
    We consider the relationship between the computational complexity classes NP and EL . Taking into account the inclusion or incomparability of these classes, the existence or nonexistence of immune sets in their differences, and the existence or nonexistence of sparse sets in the differences, there are exactly 24 different cases for their relationship. We show that 16 cases are impossible in the real nonrelativized world as well as in any relativized world. Each of the remaining 8 cases is realizable in (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  20
    Mass problems and density.Stephen Binns, Richard A. Shore & Stephen G. Simpson - 2016 - Journal of Mathematical Logic 16 (2):1650006.
    Recall that [Formula: see text] is the lattice of Muchnik degrees of nonempty effectively compact sets in Euclidean space. We solve a long-standing open problem by proving that [Formula: see text] is dense, i.e. satisfies [Formula: see text]. Our proof combines an oracle construction with hyperarithmetical theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  46
    Implicit Definability in Arithmetic.Stephen G. Simpson - 2016 - Notre Dame Journal of Formal Logic 57 (3):329-339.
    We consider implicit definability over the natural number system $\mathbb{N},+,\times,=$. We present a new proof of two theorems of Leo Harrington. The first theorem says that there exist implicitly definable subsets of $\mathbb{N}$ which are not explicitly definable from each other. The second theorem says that there exists a subset of $\mathbb{N}$ which is not implicitly definable but belongs to a countable, explicitly definable set of subsets of $\mathbb{N}$. Previous proofs of these theorems have used finite- or infinite-injury priority constructions. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  15
    Mark Burgin’s Legacy: The General Theory of Information, the Digital Genome, and the Future of Machine Intelligence.Rao Mikkilineni - 2023 - Philosophies 8 (6):107.
    With 500+ papers and 20+ books spanning many scientific disciplines, Mark Burgin has left an indelible mark and legacy for future explorers of human thought and information technology professionals. In this paper, I discuss his contribution to the evolution of machine intelligence using his general theory of information (GTI) based on my discussions with him and various papers I co-authored during the past eight years. His construction of a new class of digital automata to overcome the barrier posed by (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  58
    Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
    It is shown that if A and C are sets of degrees uniformly recursive in 0' with $\mathbf{0} \nonin \mathscr{C}$ then there is a degree b with b' = 0', b ∪ c = 0' for every c ∈ C, and $\mathbf{a} \nleq \mathbf{b}$ for every a ∈ A ∼ {0}. The proof is given as an oracle construction recursive in 0'. It follows that any nonrecursive degree below 0' can be joined to 0' by a degree strictly (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  14.  13
    A Minimal Set Low for Speed.Rod Downey & Matthew Harrison-Trainor - 2022 - Journal of Symbolic Logic 87 (4):1693-1728.
    An oracle A is low-for-speed if it is unable to speed up the computation of a set which is already computable: if a decidable language can be decided in time $t(n)$ using A as an oracle, then it can be decided without an oracle in time $p(t(n))$ for some polynomial p. The existence of a set which is low-for-speed was first shown by Bayer and Slaman who constructed a non-computable computably enumerable set which is low-for-speed. In this (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  45
    New Relations and Separations of Conjectures About Incompleteness in the Finite Domain.Erfan Khaniki - 2022 - Journal of Symbolic Logic 87 (3):912-937.
    In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as $\mathsf {P}\neq \mathsf {NP}$ [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of this kind had been (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  38
    Normal Numbers and Limit Computable Cantor Series.Achilles Beros & Konstantinos Beros - 2017 - Notre Dame Journal of Formal Logic 58 (2):215-220.
    Given any oracle, A, we construct a basic sequence Q, computable in the jump of A, such that no A-computable real is Q-distribution-normal. A corollary to this is that there is a Δn+10 basic sequence with respect to which no Δn0 real is distribution-normal. As a special case, there is a limit computable sequence relative to which no computable real is distribution-normal.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  17. Superintelligence: paths, dangers, strategies.Nick Bostrom (ed.) - 2003 - Oxford University Press.
    The human brain has some capabilities that the brains of other animals lack. It is to these distinctive capabilities that our species owes its dominant position. Other animals have stronger muscles or sharper claws, but we have cleverer brains. If machine brains one day come to surpass human brains in general intelligence, then this new superintelligence could become very powerful. As the fate of the gorillas now depends more on us humans than on the gorillas themselves, so the fate of (...)
    No categories
  18.  60
    Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
    A set $B\subseteq\mathbb{N}$ is called low for Martin-Löf random if every Martin-Löf random set is also Martin-Löf random relative to B . We show that a $\Delta^0_2$ set B is low for Martin-Löf random if and only if the class of oracles which compress less efficiently than B , namely, the class $\mathcal{C}^B=\{A\ |\ \forall n\ K^B(n)\leq^+ K^A(n)\}$ is countable (where K denotes the prefix-free complexity and $\leq^+$ denotes inequality modulo a constant. It follows that $\Delta^0_2$ is the largest arithmetical (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  13
    On the Turing complexity of learning finite families of algebraic structures.Luca San Mauro & Nikolay Bazhenov - 2021 - Journal of Logic and Computation 7 (31):1891-1900.
    In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power that is needed to learn finite families of structures. In particular, we prove that, if a family of structures is both finite and learnable, then any oracle which computes the Halting set is able to achieve such a learning. On the other hand, we (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  20. Moral Falsity in the Eyes of the Superhuman: The Cases of Socrates and Mozi.Yumi Suzuki - 2017 - Frontiers of Philosophy in China 4 (12):515-532.
    Both Socrates and Mozi are said in Plato’s dialogues and in the Mozi respectively to have claimed that they are living a sort of life following superhuman “intention”: Socrates according to the Delphic oracle, and Mozi the intention of heaven. Some modern philosophers show discomfort with their “superstitious” attitudes, taking the claims literally as a kind of groundless devotion, while others conjecture “sensible” purposes to understand the mystic elements as providing moral lessons. This paper, by responding to these modern (...)
     
    Export citation  
     
    Bookmark  
  21.  43
    Human Goodness: Pragmatic Variations on Platonic Themes (review).Catherine E. Morrison - 2008 - Philosophy and Rhetoric 41 (2):190-194.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Human Goodness: Pragmatic Variations on Platonic ThemesCatherine E. MorrisonHuman Goodness: Pragmatic Variations on Platonic Themes by Paul Schollmeier Cambridge: Cambridge University Press, 2006. Pp. x + 302. $80.00, cloth.This is a book about spirits—human, godly, ghostly, and alcoholic. Paul Schollmeier's Human Goodness: Pragmatic Variations on Platonic Themes explores how humble humans act morally in an absurd world. Schollmeier contends that the Socratic spirit, or daimon, of self-knowledge and (...)
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  22.  30
    On parallel hierarchies and Rki.Stephen Bloch - 1997 - Annals of Pure and Applied Logic 89 (2-3):231-273.
    This paper defines natural hierarchies of function and relation classes □i,kc and Δi,kc, constructed from parallel complexity classes in a manner analogous to the polynomial-time hierarchy. It is easily shown that □i−1,kp □c,kc □i,kp and similarly for the Δ classes. The class □i,3c coincides with the single-valued functions in Buss et al.'s class , and analogously for other growth rates. Furthermore, the class □i,kc comprises exactly the functions Σi,kb-definable in Ski−1, and if Tki−1 is Σi,kb-conservative over Ski−1, then □i,kp is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  16
    Recipes, Beyond Computational Procedures.Gianmarco Tuccini, Laura Corti, Luca Baronti & Roberta Lanfredini - 2020 - Humana Mente 13 (38).
    The automation of many repetitive or dangerous human activities yields numerous advantages. In order to automate a physical task that requires a finite series of sequential steps, the translation of those steps in terms of a computational procedure is often required. Even apparently menial tasks like following a cooking recipe may involve complex operations that can’t be perfectly described in formal terms. Recently, several studies have explored the possibility to model cooking recipes as a computational procedure based on a set (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  14
    The unity of mathematics in Plato's Republic.Theokritos Kouremenos - 2015 - Stuttgart: Franz Steiner Verlag.
    In his Republic Plato considers grasping the unity of mathematics as the ultimate goal of the mathematical studies in which the future philosopher-rulers must engage before they turn to philosophy. How the unity of mathematics is supposed to be understood is not explained, however. This book argues that Plato conceives of the unity of mathematics in terms of the mutually benefiting links between its branches, just as he conceives of the unity of the state outlined in the Republic in terms (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  40
    Proof and disproof in formal logic: an introduction for programmers.Richard Bornat - 2005 - New York: Oxford University Press.
    Proof and Disproof in Formal Logic is a lively and entertaining introduction to formal logic providing an excellent insight into how a simple logic works. Formal logic allows you to check a logical claim without considering what the claim means. This highly abstracted idea is an essential and practical part of computer science. The idea of a formal system-a collection of rules and axioms, which define a universe of logical proofs-is what gives us programming languages and modern-day programming. This book (...)
  26.  58
    Post's problem for supertasks has both positive and negative solutions.Joel David Hamkins & Andrew Lewis - 2002 - Archive for Mathematical Logic 41 (6):507-523.
    The infinite time Turing machine analogue of Post's problem, the question whether there are semi-decidable supertask degrees between 0 and the supertask jump 0∇, has in a sense both positive and negative solutions. Namely, in the context of the reals there are no degrees between 0 and 0∇, but in the context of sets of reals, there are; indeed, there are incomparable semi-decidable supertask degrees. Both arguments employ a kind of transfinite-injury construction which generalizes canonically to oracles.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  42
    Cosmopolitanism and the Creative Activism of Public Art.Fred Evans - 2023 - Journal of Aesthetics and Art Criticism 81 (2):213-227.
    Cosmopolitanism seeks a political ethics of world togetherness and a political aesthetics that can contribute to this task critically and imaginatively. Regarding political ethics, I explore the world as a “cosmopolitan mind” composed of “dialogic voices” and threatened by neoliberalism, neofascism, and other nihilistic “oracles.” I also construct a criterion for determining which public artworks (1) resist oracles and (2) help us imagine a “cosmopolitan democracy” and its political ethics. The latter includes the concordance of three ethico-political virtues—solidarity, heterogeneity, and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  98
    Enumerations of the Kolmogorov Function.Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan & Leen Torenvliet - 2006 - Journal of Symbolic Logic 71 (2):501 - 528.
    A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  46
    Automorphisms in the PTIME-Turing degrees of recursive sets.Christine Ann Haught & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 84 (1):139-152.
    We consider questions related to the rigidity of the structure R, the PTIME-Turing degrees of recursive sets of strings together with PTIME-Turing reducibility, pT, and related structures; do these structures have nontrivial automorphisms? We prove that there is a nontrivial automorphism of an ideal of R. This can be rephrased in terms of partial relativizations. We consider the sets which are PTIME-Turing computable from a set A, and call this class PTIMEA. Our result can be stated as follows: There is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30. A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
    Hypercomputation—the hypothesis that Turing-incomputable objects can be computed through infinitary means—is ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  31.  30
    The Formal Layer of {Brain and Mind} and Emerging Consciousness in Physical Systems.Jerzy Król & Andrew Schumann - forthcoming - Foundations of Science:1-30.
    We consider consciousness attributed to systems in space-time which can be purely physical without biological background and focus on the mathematical understanding of the phenomenon. It is shown that the set theory based on sets in the foundations of mathematics, when switched to set theory based on ZFC models, is a very promising mathematical tool in explaining the brain/mind complex and the emergence of consciousness in natural and artificial systems. We formalise consciousness-supporting systems in physical space-time, but this is localised (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  26
    Superintelligence: Paths, Dangers, Strategies vol. 1.Nick Bostrom - 2014 - Oxford University Press; 1st edition.
    The human brain has some capabilities that the brains of other animals lack. It is to these distinctive capabilities that our species owes its dominant position. Other animals have stronger muscles or sharper claws, but we have cleverer brains. If machine brains one day come to surpass human brains in general intelligence, then this new superintelligence could become very powerful. As the fate of the gorillas now depends more on us humans than on the gorillas themselves, so the fate of (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  27
    Covering the Baire space by families which are not finitely dominating.Heike Mildenberger, Saharon Shelah & Boaz Tsaban - 2006 - Annals of Pure and Applied Logic 140 (1):60-71.
    It is consistent that each union of many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter , the cofinality of the reduced ultrapower is greater than . The model is constructed by oracle chain condition forcing, to which we give a self-contained introduction.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  34. Les philosophes et les mystères dans l'Empire romain.Nicole Belayche & Francesco Massa (eds.) - 2021 - Liège (Belgique): Presses Universitaires de Liège.
    Les pratiques et les discours philosophiques sous l'empire romain ont été largement inspirés par le langage des cultes à mystères. Depuis la période grecque classique, la pensée philosophique antique a assimilé et réélaboré la terminologie de ces cultes afin d'exprimer l'accès au savoir philosophique, le parcours de la connaissance et l'acquisition d'une 'révélation' réservée aux seuls initiés. Au fil des siècles, le langage platonicien, pétri de références aux cultes à mystères, devient le socle commun de la plupart des lettrés, quelle (...)
    No categories
     
    Export citation  
     
    Bookmark  
  35.  95
    Logical, Semantic and Cultural Paradoxes.Anna Orlandini - 2003 - Argumentation 17 (1):65-86.
    The property common to three kinds of paradoxes (logical, semantic, and cultural) is the underlying presence of an exclusive disjunction: even when it is put to a check by the paradox, it is still invoked at the level of implicit discourse. Hence the argumentative strength of paradoxical propositions is derived. Logical paradoxes (insolubilia) always involve two contradictory, mutually exclusive, truths. One truth is always perceived to the detriment of the other, in accordance with a succession which is endlessly repetitive. A (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  24
    Polymorphic extensions of simple type structures. With an application to a bar recursive minimization.Erik Barendsen & Marc Bezem - 1996 - Annals of Pure and Applied Logic 79 (3):221-280.
    The technical contribution of this paper is threefold.First we show how to encode functionals in a ‘flat’ applicative structure by adding oracles to untyped λ-calculus and mimicking the applicative behaviour of the functionals with an impredicatively defined reduction relation. The main achievement here is a Church-Rosser result for the extended reduction relation.Second, by combining the previous result with the model construction based on partial equivalence relations, we show how to extend a λ-closed simple type structure to a model of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  80
    On one-sided versus two-sided classification.Stephan Frank - 2001 - Archive for Mathematical Logic 40 (7):489-513.
    One-sided classifiers are computable devices which read the characteristic function of a set and output a sequence of guesses which converges to 1 iff the set on the input belongs to the gven class. Such a classifier istwo-sided if the sequence of its output in addition converges to 0 on setsnot belonging to the class. The present work obtains the below mentionedresults for one-sided classes (= Σ0 2 classes) with respect to four areas: Turing complexity, 1-reductions, index sets and measure.There (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  38. Euripides' Hippolytus.Sean Gurd - 2012 - Continent 2 (3):202-207.
    The following is excerpted from Sean Gurd’s translation of Euripides’ Hippolytus published with Uitgeverij this year. Though he was judged “most tragic” in the generation after his death, though more copies and fragments of his plays have survived than of any other tragedian, and though his Orestes became the most widely performed tragedy in Greco-Roman Antiquity, during his lifetime his success was only moderate, and to him his career may have felt more like a failure. He was regularly selected to (...)
    No categories
     
    Export citation  
     
    Bookmark  
  39. The End Times of Philosophy.François Laruelle - 2012 - Continent 2 (3):160-166.
    Translated by Drew S. Burk and Anthony Paul Smith. Excerpted from Struggle and Utopia at the End Times of Philosophy , (Minneapolis: Univocal Publishing, 2012). THE END TIMES OF PHILOSOPHY The phrase “end times of philosophy” is not a new version of the “end of philosophy” or the “end of history,” themes which have become quite vulgar and nourish all hopes of revenge and powerlessness. Moreover, philosophy itself does not stop proclaiming its own death, admitting itself to be half dead (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  40.  22
    Alan Turing's systems of logic: the Princeton thesis.Andrew W. Appel (ed.) - 2012 - Woodstock, England: Princeton University Press.
    Between inventing the concept of a universal computer in 1936 and breaking the German Enigma code during World War II, Alan Turing, the British founder of computer science and artificial intelligence, came to Princeton University to study mathematical logic. Some of the greatest logicians in the world--including Alonzo Church, Kurt Gödel, John von Neumann, and Stephen Kleene--were at Princeton in the 1930s, and they were working on ideas that would lay the groundwork for what would become known as computer science. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  41. L'invention du Turco: Construction et déconstruction d'une catégorie.Construction Et Déconstruction D'une Catégorie - 2008 - In Frank Alvarez-Pereyre (ed.), Catégories et catégorisation: une perspective interdisciplinaire. Dudley, MA: Peeters. pp. 48.
    No categories
     
    Export citation  
     
    Bookmark  
  42. Chapter Ten Art Constructs as Generators of the Meaning of the Work of Art Viktor F. Petrenko and Olga N. Sapsoleva.Art Constructs as Generators - 2007 - In Leonid Dorfman, Colin Martindale & Vladimir Petrov (eds.), Aesthetics and innovation. Newcastle, UK: Cambridge Scholars Press.
    No categories
     
    Export citation  
     
    Bookmark  
  43. Practices of Truth-Finding in a Court of Law: The Case of Revised Stories Kim Lane Scheppele.Construction Of Social - 1994 - In Theodore R. Sarbin & John I. Kitsuse (eds.), Constructing the social. Thousand Oaks, Calif.: Sage Publications. pp. 84.
     
    Export citation  
     
    Bookmark  
  44. The relevance of causal social construction.Teresa Marques - 2017 - Journal of Social Ontology 3 (1):DOI: 10.1515/jso-2016-0018.
    Social constructionist claims are surprising and interesting when they entail that presumably natural kinds are in fact socially constructed. The claims are interesting because of their theoretical and political importance. Authors like Díaz-León argue that constitutive social construction is more relevant for achieving social justice than causal social construction. This paper challenges this claim. Assuming there are socially salient groups that are discriminated against, the paper presents a dilemma: if there were no constitutively constructed social kinds, the causes (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  45. The Construction of Social Reality.John Searle - 1995 - Free Press.
    In The Construction of Social Reality, John Searle argues that there are two kinds of facts--some that are independent of human observers, and some that require..
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   595 citations  
  46. Biases in Niche Construction.Felipe Nogueira de Carvalho & Joel Krueger - 2023 - Philosophical Psychology:1-31.
    Niche construction theory highlights the active role of organisms in modifying their environment. A subset of these modifications is the developmental niche, which concerns ecological, epistemic, social and symbolic legacies inherited by organisms as resources that scaffold their developmental processes. Since in this theory development is a situated process that takes place in a culturally structured environment, we may reasonably ask if implicit cultural biases may, in some cases, be responsible for maladaptive developmental niches. In this paper we wish (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  47. Niche construction, biological evolution, and cultural change.Kevin N. Laland, John Odling-Smee & Marcus W. Feldman - 2000 - Behavioral and Brain Sciences 23 (1):131-146.
    We propose a conceptual model that maps the causal pathways relating biological evolution to cultural change. It builds on conventional evolutionary theory by placing emphasis on the capacity of organisms to modify sources of natural selection in their environment (niche construction) and by broadening the evolutionary dynamic to incorporate ontogenetic and cultural processes. In this model, phenotypes have a much more active role in evolution than generally conceived. This sheds light on hominid evolution, on the evolution of culture, and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   201 citations  
  48. Aletheia, poiesis, and Eros: Truth and untruth in the poetic.Construction Of Love - 2000 - In Hugh J. Silverman (ed.), Philosophy and Desire. New York: Routledge. pp. 17.
    No categories
     
    Export citation  
     
    Bookmark  
  49. Geometry, construction, and intuition in Kant and his successors.Michael Friedman - 2000 - In Gila Sher & Richard Tieszen (eds.), Between logic and intuition: essays in honor of Charles Parsons. New York: Cambridge University Press. pp. 186--218.
  50.  95
    Cognition, construction of knowledge, and teaching.Ernst Glasersfeld - 1989 - Synthese 80 (1):121-140.
    The existence of objective knowledge and the possibility of communicating it by means of language have traditionally been taken for granted by educators. Recent developments in the philosophy of science and the historical study of scientific accomplishments have deprived these presuppositions of their former plausibility. Sooner or later, this must have an effect on the teaching of science. In this paper I am presenting a brief outline of an alternative theory of knowing that takes into account the thinking organism''s cognitive (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   52 citations  
1 — 50 / 970