Back to Results
First PageMeta Content
Theoretical computer science / Models of computation / Lambda calculus / Symbol / Function / Curry–Howard correspondence / Fast-growing hierarchy / Mathematics / Mathematical logic / Computability theory


Infinite sets that admit fast exhaustive search Mart´ın Escard´o School of Computer Science, University of Birmingham, UK
Add to Reading List

Document Date: 2007-03-27 09:33:39

Open Document

File Size: 261,41 KB

Share Result on Facebook

City

Urbana / Oxford / /

Company

K. / /

Currency

pence / /

Event

Person Communication and Meetings / /

Facility

University of Birmingham / /

IndustryTerm

above algorithms / mechanical exhaustive search / search realizer / above product / higher-type algorithms / finite products / deeper algorithms / countable products / finite and infinite products / search operators / Lazy functional algorithms / sequential algorithm / boolean exhaustion operator / computing / above algorithm / highertype algorithms / comparison algorithm / minimization operator / formal systems / exhaustive search / negative solution / search operator / particular algorithm / infinite products / /

Organization

Mart´ın Escard´o School of Computer Science / School of Computer Science / Mathematisches Institut / University of Birmingham / /

Person

Ulrich Berger / Matthias Schr¨oder / John Longley / Andrej Bauer / Dan Ghica / Achim Jung / Alex Simpson / /

Position

Working Mathematician / Glasgow Haskell interpreter / /

Product

Haskell / /

ProgrammingLanguage

Haskell / /

ProvinceOrState

Illinois / /

PublishedMedium

Logical Methods in Computer Science / /

Technology

above algorithms / above algorithm / sequential algorithm / deeper algorithms / particular algorithm / Lazy functional algorithms / comparison algorithm / higher-type algorithms / highertype algorithms / /

URL

http /

SocialTag