Results 111 to 120 of about 793,130 (202)
Isomorphism Theorem for BSS Recursively Enumerable Sets over Real Closed Fields
The main result of this paper lies in the framework of BSS computability : it shows roughly that any recursively enumerable set S in R N 6 1, where R is a real closed field, is isomorphic to R dimS by a bijection ' which is decidable over S.
Christian Michaux, Christophe Troestler
core
Strategic framing of novel ideas: How contestation shapes the evolution of novelty
Abstract Research Summary Entrepreneurs use strategic framing to gain support for their novel ventures, products, and services. A key challenge entrepreneurs face is that audiences often contest frames that introduce novel ideas, especially when these ideas disrupt audiences' mental and business models.
Janina Klein +2 more
wiley +1 more source
Why theory matters for causal inference? Rethinking endogeneity in entrepreneurship research
Abstract Endogeneity in entrepreneurship research is often treated as a statistical complication addressable through advanced econometric tools. This commentary argues that such an approach overlooks a deeper issue: endogeneity is conceptual before it is statistical.
Daniel Tzabbar
wiley +1 more source
Extension of embeddings in the recursively enumerable degrees
The extension of embeddings problem for the recursively enumerable degrees R = (R;!; 0; 0 0) asks for given finite partially ordered sets P ` Q with least and greatest elements, whether every embedding of P into R can be extended to an embedding of Q ...
Theodore A. Slaman, Robert I. Soare
core
Temporal grammars of novelty: How carbon removal entrepreneurs frame new technologies
Abstract Research Summary This paper assesses the ways in which carbon dioxide removal ventures frame their work. Drawing on George Herbert Mead's philosophy of the present, it conceptualizes temporal grammars of novelty as a framing strategy that involves connecting two points in time, namely present and future, to elaborate novelty.
Ioana Sendroiu
wiley +1 more source
ISOMORPHISM OF LATTICES OF RECURSIVELY ENUMERABLE SETS
. Let ω = { 0, 1, 2,...}, and for A ⊆ ω, let E A be the lattice of subsets of ω which are recursively enumerable relative to the “oracle ” A. Let (E A) ∗ be E A /I, whereIis the ideal of finite subsets of ω.
Todd Hammond
core
Abstract Research Summary This conceptual study develops a process theory of vulnerability acceptance explaining how trust and behavioral uncertainty coevolve as entrepreneurial actors form, interpret, and realize opportunities. Trust is frequently invoked to explain creativity, exploration, and opportunity formation, yet remains theorized through ...
Lars Huemer, Jan Ketil Arnulf
wiley +1 more source
Post's Program and incomplete recursively enumerable sets
: A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that: (1) if A is any r.e.
Leo Harrington, Robert I. Soare
core
Can AI be Easy? Lessons Learned From the EZR.py Toolkit
ABSTRACT Much recent press claims that developers no longer need to read code. We disagree, at least within the domain of tabular software‐engineering (SE) optimization tasks: rows of x$$ x $$ and y$$ y $$ values where the y$$ y $$ values are expensive to obtain.
Tim Menzies +2 more
wiley +1 more source
Generative AI—the Transgression of Technology
ABSTRACT This article offers a systems‐theoretical analysis of generative artificial intelligence (GenAI) grounded in Niklas Luhmann's sociology of technology. It addresses a central conceptual problem: How GenAI can be understood within a theoretical framework that has traditionally defined technology as a means of stabilising action through causal ...
Jesper Tække
wiley +1 more source

