Reducibility and nonbinding

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonbinding Voting for Shareholder Proposals

Shareholder proposals are a common form of shareholder activism. Voting for shareholder proposals, however, is nonbinding since management has the authority to reject the proposal even if it received majority support from shareholders. We analyze whether nonbinding voting is an effective mechanism for conveying shareholder expectations. We show that, unlike binding voting, nonbinding voting gen...

متن کامل

Randomness and Reducibility

How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like? The goal of this paper is to look at questions like these, specifically by studying the properties of reducibilities that act as measures of relative randomness, as embodied in the concept of initia...

متن کامل

Reducibility and Completeness

There is little doubt that the notion of reducibility is the most useful tool that complexity theory has delivered to the rest of the computer science community. For most computational problems that arise in real-world applications, such as the Traveling Salesperson Problem, we still know little about their deterministic time or space complexity. We cannot now tell whether classes such as P and...

متن کامل

Computational Depth and Reducibility

This paper reviews and investigates Bennett s notions of strong and weak computational depth also called logical depth for in nite binary sequences Roughly an in nite binary sequence x is de ned to be weakly useful if every element of a non negligible set of decidable sequences is reducible to x in recursively bounded time It is shown that every weakly useful sequence is strongly deep This resu...

متن کامل

Rosenberg , Reducibility and Consciousness

Although original, intricate and sophisticated, Gregg Rosenberg’s core argument in favor of panpsychism is a version of an argument that has been around for some time. My paper tries to shed some light on Rosenberg's strategy by comparing it to the views of Leibniz (or a fictional philosopher close to him) who took a similar approach. At the heart of the argument is the idea that relational pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 1995

ISSN: 0166-8641

DOI: 10.1016/0166-8641(95)00054-k